Primality proof for n = 214692087848261:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1114261.html>1114261 is prime.</a>
<br>b^((n-1)/1114261)-1 mod n = 58927038618951, which is a unit, inverse 86397854197348.
<p><a href=875803.html>875803 is prime.</a>
<br>b^((n-1)/875803)-1 mod n = 195521985384770, which is a unit, inverse 82045486938931.
<p>(875803 * 1114261) divides n-1.
<p>(875803 * 1114261)^2 > n.
<p>n is prime by Pocklington's theorem.