10210100001111 has 16 divisors (see below), whose sum is σ = 15922183238400. Its totient is φ = 6448484210904.

The previous prime is 10210100001097. The next prime is 10210100001113. The reversal of 10210100001111 is 11110000101201.

It is not a de Polignac number, because 10210100001111 - 2⁹ = 10210100000599 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10210100001113) 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, 9951364011 + ... + 9951365036.

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

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

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

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

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

The sum of its prime factors is 19902729075 (or 19902729069 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 10210100001111 its reverse (11110000101201), we get a palindrome (21320100102312).

The spelling of 10210100001111 in words is "ten trillion, two hundred ten billion, one hundred million, one thousand, one hundred eleven".