Take b = 2.

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

455737 is prime. b^((n-1)/455737)-1 mod n = 50840749, which is a unit, inverse 75176620.

(455737) divides n-1.

(455737)^2 > n.

n is prime by Pocklington's theorem.