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