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