Primality proof for n = 37344768852931:
Take b = 2.
b^(n-1) mod n = 1.
9863677 is prime.
b^((n-1)/9863677)-1 mod n = 872691691967, which is a unit, inverse 16534501050212.
(9863677) divides n-1.
(9863677)^2 > n.
n is prime by Pocklington's theorem.