Take b = 2.

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

497801 is prime. b^((n-1)/497801)-1 mod n = 438802267, which is a unit, inverse 261484353.

(497801) divides n-1.

(497801)^2 > n.

n is prime by Pocklington's theorem.