Primality proof for n = 1424961889141606181:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=7959649.html>7959649 is prime.</a>
<br>b^((n-1)/7959649)-1 mod n = 1342969993534657940, which is a unit, inverse 340802350814694891.
<p><a href=58481.html>58481 is prime.</a>
<br>b^((n-1)/58481)-1 mod n = 1057125979828876387, which is a unit, inverse 813073097731928778.
<p>(58481 * 7959649) divides n-1.
<p>(58481 * 7959649)^2 > n.
<p>n is prime by Pocklington's theorem.