Primality proof for n = 450180037:
Take b = 2.
b^(n-1) mod n = 1.
337973 is prime. b^((n-1)/337973)-1 mod n = 346312467, which is a unit, inverse 245084851.
(337973) divides n-1.
(337973)^2 > n.
n is prime by Pocklington's theorem.