20110211011111 has 4 divisors (see below), whose sum is σ = 21657150319672. Its totient is φ = 18563271702552.

The previous prime is 20110211011091. The next prime is 20110211011127. The reversal of 20110211011111 is 11111011201102.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 20110211011111 - 2⁹ = 20110211010599 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 1546939308547 = 20110211011111 / (2 + 0 + 1 + 1 + 0 + 2 + 1 + 1 + 0 + 1 + 1 + 1 + 1 + 1).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20110211014111) 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 in 3 ways as a sum of consecutive naturals, for example, 773469654261 + ... + 773469654286.

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

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

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

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

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

The sum of its prime factors is 1546939308560.

The product of its (nonzero) digits is 4, while the sum is 13.

Adding to 20110211011111 its reverse (11111011201102), we get a palindrome (31221222212213).

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