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