Take b = 2.

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

70825721 is prime. b^((n-1)/70825721)-1 mod n = 2424040767, which is a unit, inverse 1336047102.

(70825721) divides n-1.

(70825721)^2 > n.

n is prime by Pocklington's theorem.