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