Primality proof for n = 45989:

Take b = 2.

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

11497 is prime.
b^((n-1)/11497)-1 mod n = 15, which is a unit, inverse 3066.

(11497) divides n-1.

(11497)^2 > n.

n is prime by Pocklington's theorem.