Primality proof for n = 1640653301747:

Take b = 2.

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

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

(820326650873) divides n-1.

(820326650873)^2 > n.

n is prime by Pocklington's theorem.