Primality proof for n = 23039:

Take b = 2.

b^(n-1) mod n = 1.

11519 is prime.
b^((n-1)/11519)-1 mod n = 3, which is a unit, inverse 7680.

(11519) divides n-1.

(11519)^2 > n.

n is prime by Pocklington's theorem.