Primality proof for n = 400457:
Take b = 2.
b^(n-1) mod n = 1.
7151 is prime. b^((n-1)/7151)-1 mod n = 229973, which is a unit, inverse 284027.
(7151) divides n-1.
(7151)^2 > n.
n is prime by Pocklington's theorem.