Primality proof for n = 657021949:
Take b = 2.
b^(n-1) mod n = 1.
4977439 is prime. b^((n-1)/4977439)-1 mod n = 311139670, which is a unit, inverse 12400254.
(4977439) divides n-1.
(4977439)^2 > n.
n is prime by Pocklington's theorem.