Primality proof for n = 250361:
Take b = 2.
b^(n-1) mod n = 1.
569 is prime. b^((n-1)/569)-1 mod n = 32346, which is a unit, inverse 120103.
(569) divides n-1.
(569)^2 > n.
n is prime by Pocklington's theorem.