1691543310013 has 2 divisors, whose sum is σ = 1691543310014. Its totient is φ = 1691543310012.

The previous prime is 1691543310001. The next prime is 1691543310029. The reversal of 1691543310013 is 3100133451961.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 877213940409 + 814329369604 = 936597^2 + 902402^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1691543310013 is a prime.

It is a super-2 number, since 2×1691543310013² (a number of 25 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1691543316013) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 845771655006 + 845771655007.

It is an arithmetic number, because the mean of its divisors is an integer number (845771655007).

Almost surely, 2^{1691543310013} is an apocalyptic number.

It is an amenable number.

1691543310013 is a deficient number, since it is larger than the sum of its proper divisors (1).

1691543310013 is an equidigital number, since it uses as much as digits as its factorization.

1691543310013 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 29160, while the sum is 37.

Adding to 1691543310013 its reverse (3100133451961), we get a palindrome (4791676761974).

The spelling of 1691543310013 in words is "one trillion, six hundred ninety-one billion, five hundred forty-three million, three hundred ten thousand, thirteen".