10111100211 has 32 divisors (see below), whose sum is σ = 15787660800. Its totient is φ = 6377914080.

The previous prime is 10111100143. The next prime is 10111100227. The reversal of 10111100211 is 11200111101.

10111100211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10111100211 - 2¹¹ = 10111098163 is a prime.

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 = 10111100193 and 10111100202.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 409170 + ... + 433176.

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

Almost surely, 2^10111100211 is an apocalyptic number.

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

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

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

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

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

Adding to 10111100211 its reverse (11200111101), we get a palindrome (21311211312).

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