Primality proof for n = 688147:
Take b = 2.
b^(n-1) mod n = 1.
114691 is prime. b^((n-1)/114691)-1 mod n = 63, which is a unit, inverse 349535.
(114691) divides n-1.
(114691)^2 > n.
n is prime by Pocklington's theorem.