Primality proof for n = 131342845410725759:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=13904599344773.html>13904599344773 is prime.</a>
<br>b^((n-1)/13904599344773)-1 mod n = 48925684169174187, which is a unit, inverse 1632403882809336.
<p>(13904599344773) divides n-1.
<p>(13904599344773)^2 > n.
<p>n is prime by Pocklington's theorem.