Primality proof for n = 213625567:

Take b = 2.

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

619 is prime.
b^((n-1)/619)-1 mod n = 189110135, which is a unit, inverse 19652744.

83 is prime.
b^((n-1)/83)-1 mod n = 15005505, which is a unit, inverse 47955895.

(83 * 619) divides n-1.

(83 * 619)^2 > n.

n is prime by Pocklington's theorem.