Primality proof for n = 2089326636302777:

Take b = 2.

b^(n-1) mod n = 1.

485175917 is prime.
b^((n-1)/485175917)-1 mod n = 382804803124880, which is a unit, inverse 902406627518387.

(485175917) divides n-1.

(485175917)^2 > n.

n is prime by Pocklington's theorem.