Take b = 2.

b^(n-1) mod n = 1.

68632771 is prime.
b^((n-1)/68632771)-1 mod n = 1749900716463, which is a unit, inverse 3210598901421.

(68632771) divides n-1.

(68632771)^2 > n.

n is prime by Pocklington's theorem.