Take b = 2.

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

65099 is prime. b^((n-1)/65099)-1 mod n = 7577688, which is a unit, inverse 21950026.

(65099) divides n-1.

(65099)^2 > n.

n is prime by Pocklington's theorem.