Take b = 2.

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

213625567 is prime. b^((n-1)/213625567)-1 mod n = 15, which is a unit, inverse 56966818.

(213625567) divides n-1.

(213625567)^2 > n.

n is prime by Pocklington's theorem.