Primality proof for n = 189989:
Take b = 2.
b^(n-1) mod n = 1.
47497 is prime. b^((n-1)/47497)-1 mod n = 15, which is a unit, inverse 12666.
(47497) divides n-1.
(47497)^2 > n.
n is prime by Pocklington's theorem.