Primality proof for n = 4310859807493:

Take b = 2.

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

394049 is prime.
b^((n-1)/394049)-1 mod n = 543675979413, which is a unit, inverse 1865434187540.

163 is prime.
b^((n-1)/163)-1 mod n = 2822299315753, which is a unit, inverse 501717291316.

(163 * 394049) divides n-1.

(163 * 394049)^2 > n.

n is prime by Pocklington's theorem.