Primality proof for n = 14501006381:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=96893.html>96893 is prime.</a>
<br>b^((n-1)/96893)-1 mod n = 7601830812, which is a unit, inverse 4498871414.
<p><a href=1069.html>1069 is prime.</a>
<br>b^((n-1)/1069)-1 mod n = 11791842976, which is a unit, inverse 5329443915.
<p>(1069 * 96893) divides n-1.
<p>(1069 * 96893)^2 > n.
<p>n is prime by Pocklington's theorem.