Take b = 2.

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

45297277 is prime. b^((n-1)/45297277)-1 mod n = 7728854036, which is a unit, inverse 1448690650.

(45297277) divides n-1.

(45297277)^2 > n.

n is prime by Pocklington's theorem.