Take b = 2.

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

532247449 is prime. b^((n-1)/532247449)-1 mod n = 9006975509752, which is a unit, inverse 29404327213793.

(532247449) divides n-1.

(532247449)^2 > n.

n is prime by Pocklington's theorem.