Primality proof for n = 14416805621:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1103.html>1103 is prime.</a>
<br>b^((n-1)/1103)-1 mod n = 8112672743, which is a unit, inverse 1464330961.
<p><a href=1049.html>1049 is prime.</a>
<br>b^((n-1)/1049)-1 mod n = 8571291448, which is a unit, inverse 4940799761.
<p>(1049 * 1103) divides n-1.
<p>(1049 * 1103)^2 > n.
<p>n is prime by Pocklington's theorem.