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