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