Primality proof for n = 1866869:
Take b = 2.
b^(n-1) mod n = 1.
466717 is prime. b^((n-1)/466717)-1 mod n = 15, which is a unit, inverse 124458.
(466717) divides n-1.
(466717)^2 > n.
n is prime by Pocklington's theorem.