Take b = 2.

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

12227 is prime. b^((n-1)/12227)-1 mod n = 16383, which is a unit, inverse 116930.

(12227) divides n-1.

(12227)^2 > n.

n is prime by Pocklington's theorem.