Primality proof for n = 114467:
Take b = 2.
b^(n-1) mod n = 1.
43 is prime.
b^((n-1)/43)-1 mod n = 12442, which is a unit, inverse 76296.
11 is prime.
b^((n-1)/11)-1 mod n = 25454, which is a unit, inverse 9790.
(11^3 * 43) divides n-1.
(11^3 * 43)^2 > n.
n is prime by Pocklington's theorem.