Base | Representation |
---|---|
bin | 1001001001010010000000… |
… | …00001100001001111110101 |
3 | 2122012111201012202212212110 |
4 | 10210221000001201033311 |
5 | 10113441001410120041 |
6 | 110434242451241233 |
7 | 4143623204162601 |
oct | 444510001411765 |
9 | 78174635685773 |
10 | 20110111020021 |
11 | 6453717446130 |
12 | 23095835a9219 |
13 | b2b4b57b2359 |
14 | 4d74980a0501 |
15 | 24d19baad516 |
hex | 124a400613f5 |
20110111020021 has 32 divisors (see below), whose sum is σ = 29868206940288. Its totient is φ = 11933243274240.
The previous prime is 20110111019981. The next prime is 20110111020023. The reversal of 20110111020021 is 12002011101102.
It is not a de Polignac number, because 20110111020021 - 27 = 20110111019893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110111019979 and 20110111020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110111020023) 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, 30136786 + ... + 30796851.
It is an arithmetic number, because the mean of its divisors is an integer number (933381466884).
Almost surely, 220110111020021 is an apocalyptic number.
It is an amenable number.
20110111020021 is a deficient number, since it is larger than the sum of its proper divisors (9758095920267).
20110111020021 is a wasteful number, since it uses less digits than its factorization.
20110111020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60933861.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20110111020021 its reverse (12002011101102), we get a palindrome (32112122121123).
The spelling of 20110111020021 in words is "twenty trillion, one hundred ten billion, one hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •