Primality proof for n = 10023031:
Take b = 2.
b^(n-1) mod n = 1.
6551 is prime. b^((n-1)/6551)-1 mod n = 3171405, which is a unit, inverse 7074623.
(6551) divides n-1.
(6551)^2 > n.
n is prime by Pocklington's theorem.