Primality proof for n = 108598647457:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=5113.html>5113 is prime.</a>
<br>b^((n-1)/5113)-1 mod n = 15367512069, which is a unit, inverse 12768722298.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 67140502316, which is a unit, inverse 52606230643.
<p><a href=31.html>31 is prime.</a>
<br>b^((n-1)/31)-1 mod n = 7011395121, which is a unit, inverse 12728058339.
<p>(31 * 61 * 5113) divides n-1.
<p>(31 * 61 * 5113)^2 > n.
<p>n is prime by Pocklington's theorem.