Take b = 2.

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

200639 is prime. b^((n-1)/200639)-1 mod n = 81663490, which is a unit, inverse 51365670.

(200639) divides n-1.

(200639)^2 > n.

n is prime by Pocklington's theorem.