Take b = 2.

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

22111 is prime. b^((n-1)/22111)-1 mod n = 63, which is a unit, inverse 48434.

(22111) divides n-1.

(22111)^2 > n.

n is prime by Pocklington's theorem.