Take b = 2.

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

20187911 is prime. b^((n-1)/20187911)-1 mod n = 3, which is a unit, inverse 13458608.

(20187911) divides n-1.

(20187911)^2 > n.

n is prime by Pocklington's theorem.