10652712205035 has 16 divisors (see below), whose sum is σ = 17050668719904. Its totient is φ = 5679336778752.

The previous prime is 10652712205033. The next prime is 10652712205039. The reversal of 10652712205035 is 53050221725601.

It is not a de Polignac number, because 10652712205035 - 2¹ = 10652712205033 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10652712204984 and 10652712205002.

It is not an unprimeable number, because it can be changed into a prime (10652712205033) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131816422 + ... + 131897211.

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

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

10652712205035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

10652712205035 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 263716334.

The product of its (nonzero) digits is 126000, while the sum is 39.

The spelling of 10652712205035 in words is "ten trillion, six hundred fifty-two billion, seven hundred twelve million, two hundred five thousand, thirty-five".