Primality proof for n = 11543603:
Take b = 2.
b^(n-1) mod n = 1.
43397 is prime. b^((n-1)/43397)-1 mod n = 4644978, which is a unit, inverse 1714135.
(43397) divides n-1.
(43397)^2 > n.
n is prime by Pocklington's theorem.