Primality proof for n = 22911527:
Take b = 2.
b^(n-1) mod n = 1.
10111 is prime. b^((n-1)/10111)-1 mod n = 21378193, which is a unit, inverse 22767558.
(10111) divides n-1.
(10111)^2 > n.
n is prime by Pocklington's theorem.