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