Primality proof for n = 11105363:
Take b = 2.
b^(n-1) mod n = 1.
10909 is prime. b^((n-1)/10909)-1 mod n = 1972647, which is a unit, inverse 9699678.
(10909) divides n-1.
(10909)^2 > n.
n is prime by Pocklington's theorem.