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