Primality proof for n = 14699:
Take b = 2.
b^(n-1) mod n = 1.
7349 is prime. b^((n-1)/7349)-1 mod n = 3, which is a unit, inverse 4900.
(7349) divides n-1.
(7349)^2 > n.
n is prime by Pocklington's theorem.