Primality proof for n = 14072969:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1487.html>1487 is prime.</a>
<br>b^((n-1)/1487)-1 mod n = 4493176, which is a unit, inverse 3493289.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 5189481, which is a unit, inverse 10174223.
<p>(13^2 * 1487) divides n-1.
<p>(13^2 * 1487)^2 > n.
<p>n is prime by Pocklington's theorem.