Primality proof for n = 4994337311:
Take b = 2.
b^(n-1) mod n = 1.
499433731 is prime. b^((n-1)/499433731)-1 mod n = 1023, which is a unit, inverse 3505312013.
(499433731) divides n-1.
(499433731)^2 > n.
n is prime by Pocklington's theorem.