Take b = 2.

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

408311 is prime. b^((n-1)/408311)-1 mod n = 4095, which is a unit, inverse 2019719.

(408311) divides n-1.

(408311)^2 > n.

n is prime by Pocklington's theorem.