Take b = 2.

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

5975923 is prime. b^((n-1)/5975923)-1 mod n = 1789717084, which is a unit, inverse 3699304885.

(5975923) divides n-1.

(5975923)^2 > n.

n is prime by Pocklington's theorem.