Take b = 2.

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

135193 is prime. b^((n-1)/135193)-1 mod n = 13575425, which is a unit, inverse 11504235.

(135193) divides n-1.

(135193)^2 > n.

n is prime by Pocklington's theorem.