Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …00101000100010110100101 |
3 | 2121212001011001100101221110 |
4 | 10203030302211010112211 |
5 | 10110330213402210041 |
6 | 110320550055335233 |
7 | 4133516512526445 |
oct | 443146245042645 |
9 | 77761131311843 |
10 | 20011101210021 |
11 | 6415729a43479 |
12 | 22b2351381519 |
13 | b2206718686c |
14 | 4d2784756125 |
15 | 24a804768516 |
hex | 1233329445a5 |
20011101210021 has 16 divisors (see below), whose sum is σ = 28086186378240. Its totient is φ = 12638396605680.
The previous prime is 20011101209941. The next prime is 20011101210083. The reversal of 20011101210021 is 12001210111002.
It is not a de Polignac number, because 20011101210021 - 210 = 20011101208997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20011101209979 and 20011101210006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011101212021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1110436 + ... + 6423026.
It is an arithmetic number, because the mean of its divisors is an integer number (1755386648640).
Almost surely, 220011101210021 is an apocalyptic number.
It is an amenable number.
20011101210021 is a deficient number, since it is larger than the sum of its proper divisors (8075085168219).
20011101210021 is a wasteful number, since it uses less digits than its factorization.
20011101210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5378696.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20011101210021 its reverse (12001210111002), we get a palindrome (32012311321023).
The spelling of 20011101210021 in words is "twenty trillion, eleven billion, one hundred one million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •