Take b = 2.

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

155317 is prime. b^((n-1)/155317)-1 mod n = 76243072, which is a unit, inverse 69522358.

(155317) divides n-1.

(155317)^2 > n.

n is prime by Pocklington's theorem.