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