Take b = 2.

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

78364019 is prime. b^((n-1)/78364019)-1 mod n = 656864911062, which is a unit, inverse 859845615215.

(78364019) divides n-1.

(78364019)^2 > n.

n is prime by Pocklington's theorem.