Primality proof for n = 6495702541:
Take b = 2.
b^(n-1) mod n = 1.
108261709 is prime. b^((n-1)/108261709)-1 mod n = 1114846649, which is a unit, inverse 892614759.
(108261709) divides n-1.
(108261709)^2 > n.
n is prime by Pocklington's theorem.