Primality proof for n = 11165728476386063307853657259304797238595952598104253398091264650988917:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=5962933401120092733206902139.html>5962933401120092733206902139 is prime.</a>
<br>b^((n-1)/5962933401120092733206902139)-1 mod n = 1230132106824540671287055319734519941000153532574891398677534932787436, which is a unit, inverse 10632907752820121326027396487946077320854954612657455225661154058395824.
<p><a href=923162760505931681.html>923162760505931681 is prime.</a>
<br>b^((n-1)/923162760505931681)-1 mod n = 10431949978057108683451237191603108812711708963728187302905901397406092, which is a unit, inverse 8092807408933943279968546141643474449682029946562993803211606951261756.
<p>(923162760505931681 * 5962933401120092733206902139) divides n-1.
<p>(923162760505931681 * 5962933401120092733206902139)^2 > n.
<p>n is prime by Pocklington's theorem.