Primality proof for n = 899437463:
Take b = 2.
b^(n-1) mod n = 1.
343559 is prime. b^((n-1)/343559)-1 mod n = 207133870, which is a unit, inverse 283276008.
(343559) divides n-1.
(343559)^2 > n.
n is prime by Pocklington's theorem.