Primality proof for n = 16066359187:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=114467.html>114467 is prime.</a>
<br>b^((n-1)/114467)-1 mod n = 15886309915, which is a unit, inverse 4582963595.
<p><a href=157.html>157 is prime.</a>
<br>b^((n-1)/157)-1 mod n = 12494035807, which is a unit, inverse 7193583742.
<p>(157 * 114467) divides n-1.
<p>(157 * 114467)^2 > n.
<p>n is prime by Pocklington's theorem.