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