Base | Representation |
---|---|
bin | 1001001001010101100011… |
… | …10111111001011001001111 |
3 | 2122012200122022221000011111 |
4 | 10210222301313321121033 |
5 | 10114003404400200421 |
6 | 110435200203032451 |
7 | 4144021426454323 |
oct | 444526167713117 |
9 | 78180568830144 |
10 | 20112021100111 |
11 | 6454507656616 |
12 | 2309a1720b727 |
13 | b2b72b435065 |
14 | 4d75d9a2d983 |
15 | 24d25e60cee1 |
hex | 124ab1df964f |
20112021100111 has 4 divisors (see below), whose sum is σ = 20155459591072. Its totient is φ = 20068582609152.
The previous prime is 20112021100097. The next prime is 20112021100141. The reversal of 20112021100111 is 11100112021102.
It is a happy number.
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 20112021100111 - 225 = 20111987545679 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112021100091 and 20112021100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112021100141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21719244786 + ... + 21719245711.
It is an arithmetic number, because the mean of its divisors is an integer number (5038864897768).
Almost surely, 220112021100111 is an apocalyptic number.
20112021100111 is a deficient number, since it is larger than the sum of its proper divisors (43438490961).
20112021100111 is an equidigital number, since it uses as much as digits as its factorization.
20112021100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43438490960.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20112021100111 its reverse (11100112021102), we get a palindrome (31212133121213).
The spelling of 20112021100111 in words is "twenty trillion, one hundred twelve billion, twenty-one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •