Primality proof for n = 125059657:

Take b = 2.

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

19813 is prime.
b^((n-1)/19813)-1 mod n = 16173461, which is a unit, inverse 98396164.

(19813) divides n-1.

(19813)^2 > n.

n is prime by Pocklington's theorem.