Primality proof for n = 13610371:
Take b = 2.
b^(n-1) mod n = 1.
26687 is prime. b^((n-1)/26687)-1 mod n = 4425159, which is a unit, inverse 6138432.
(26687) divides n-1.
(26687)^2 > n.
n is prime by Pocklington's theorem.