Primality proof for n = 1942692491:

Take b = 2.

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

68477 is prime.
b^((n-1)/68477)-1 mod n = 810102655, which is a unit, inverse 665058820.

(68477) divides n-1.

(68477)^2 > n.

n is prime by Pocklington's theorem.