Take b = 2.

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

453181 is prime. b^((n-1)/453181)-1 mod n = 1023, which is a unit, inverse 1147350.

(453181) divides n-1.

(453181)^2 > n.

n is prime by Pocklington's theorem.