Primality proof for n = 1798367:
Take b = 2.
b^(n-1) mod n = 1.
899183 is prime. b^((n-1)/899183)-1 mod n = 3, which is a unit, inverse 599456.
(899183) divides n-1.
(899183)^2 > n.
n is prime by Pocklington's theorem.