Take b = 2.

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

552833 is prime. b^((n-1)/552833)-1 mod n = 70959555378, which is a unit, inverse 22559638404.

(552833) divides n-1.

(552833)^2 > n.

n is prime by Pocklington's theorem.