Take b = 2.

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

173497 is prime. b^((n-1)/173497)-1 mod n = 15, which is a unit, inverse 46266.

(173497) divides n-1.

(173497)^2 > n.

n is prime by Pocklington's theorem.