Base | Representation |
---|---|
bin | 1001000110011001100110… |
… | …01110100111010010011110 |
3 | 2121212001011210211201120212 |
4 | 10203030303032213102132 |
5 | 10110330224144213042 |
6 | 110320551125012422 |
7 | 4133520004226600 |
oct | 443146316472236 |
9 | 77761153751525 |
10 | 20011112101022 |
11 | 6415735101aa9 |
12 | 22b2354b54112 |
13 | b220694cab43 |
14 | 4d2785d8d170 |
15 | 24a8056ba482 |
hex | 1233333a749e |
20011112101022 has 48 divisors (see below), whose sum is σ = 35141415388992. Its totient is φ = 8521219748160.
The previous prime is 20011112101007. The next prime is 20011112101027. The reversal of 20011112101022 is 22010121111002.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 20011112100988 and 20011112101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011112101027) 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 23 ways as a sum of consecutive naturals, for example, 26465372 + ... + 27210992.
It is an arithmetic number, because the mean of its divisors is an integer number (732112820604).
Almost surely, 220011112101022 is an apocalyptic number.
20011112101022 is a deficient number, since it is larger than the sum of its proper divisors (15130303287970).
20011112101022 is a wasteful number, since it uses less digits than its factorization.
20011112101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747393 (or 747386 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20011112101022 its reverse (22010121111002), we get a palindrome (42021233212024).
The spelling of 20011112101022 in words is "twenty trillion, eleven billion, one hundred twelve million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •