Primality proof for n = 13884229:

Take b = 2.

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

1699 is prime.
b^((n-1)/1699)-1 mod n = 459948, which is a unit, inverse 7717093.

227 is prime.
b^((n-1)/227)-1 mod n = 3562654, which is a unit, inverse 2028670.

(227 * 1699) divides n-1.

(227 * 1699)^2 > n.

n is prime by Pocklington's theorem.