Primality proof for n = 485175917:
Take b = 2.
b^(n-1) mod n = 1.
134921 is prime. b^((n-1)/134921)-1 mod n = 483358435, which is a unit, inverse 396754500.
(134921) divides n-1.
(134921)^2 > n.
n is prime by Pocklington's theorem.