Primality proof for n = 9265609:
Take b = 2.
b^(n-1) mod n = 1.
11699 is prime. b^((n-1)/11699)-1 mod n = 5184505, which is a unit, inverse 3020700.
(11699) divides n-1.
(11699)^2 > n.
n is prime by Pocklington's theorem.