Primality proof for n = 45265241663:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=997.html>997 is prime.</a>
<br>b^((n-1)/997)-1 mod n = 25636981309, which is a unit, inverse 38287484439.
<p><a href=661.html>661 is prime.</a>
<br>b^((n-1)/661)-1 mod n = 8343847944, which is a unit, inverse 13961776954.
<p>(661 * 997) divides n-1.
<p>(661 * 997)^2 > n.
<p>n is prime by Pocklington's theorem.