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