10701499213 has 2 divisors, whose sum is σ = 10701499214. Its totient is φ = 10701499212.

The previous prime is 10701499153. The next prime is 10701499261. The reversal of 10701499213 is 31299410701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9169403049 + 1532096164 = 95757^2 + 39142^2 .

It is a cyclic number.

It is not a de Polignac number, because 10701499213 - 2¹⁷ = 10701368141 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2^10701499213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10701499213 in words is "ten billion, seven hundred one million, four hundred ninety-nine thousand, two hundred thirteen".