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