Primality proof for n = 141700345513649190797:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=49645261.html>49645261 is prime.</a>
<br>b^((n-1)/49645261)-1 mod n = 68637403196926561836, which is a unit, inverse 49270303936658816112.
<p><a href=9535423.html>9535423 is prime.</a>
<br>b^((n-1)/9535423)-1 mod n = 53425856062283740560, which is a unit, inverse 83653541202313293261.
<p>(9535423 * 49645261) divides n-1.
<p>(9535423 * 49645261)^2 > n.
<p>n is prime by Pocklington's theorem.