Primality proof for n = 15643211:

Take b = 2.

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

142211 is prime.
b^((n-1)/142211)-1 mod n = 7946300, which is a unit, inverse 4998333.

(142211) divides n-1.

(142211)^2 > n.

n is prime by Pocklington's theorem.