Base | Representation |
---|---|
bin | 1001000110101101111001… |
… | …10111000100100111100100 |
3 | 2121220002022101021021001010 |
4 | 10203112330313010213210 |
5 | 10111020034321320400 |
6 | 110325552424502220 |
7 | 4134354046323453 |
oct | 443267467044744 |
9 | 77802271237033 |
10 | 20022011120100 |
11 | 641a318339390 |
12 | 22b449701a970 |
13 | b230b552a362 |
14 | 4d30db694b9a |
15 | 24ac4245e450 |
hex | 1235bcdc49e4 |
20022011120100 has 72 divisors (see below), whose sum is σ = 63196747836768. Its totient is φ = 4853820876800.
The previous prime is 20022011120077. The next prime is 20022011120147. The reversal of 20022011120100 is 102111022002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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, 3033634749 + ... + 3033641348.
It is an arithmetic number, because the mean of its divisors is an integer number (877732608844).
Almost surely, 220022011120100 is an apocalyptic number.
20022011120100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20022011120100 is an abundant number, since it is smaller than the sum of its proper divisors (43174736716668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022011120100 is a wasteful number, since it uses less digits than its factorization.
20022011120100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6067276125 (or 6067276118 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20022011120100 its reverse (102111022002), we get a palindrome (20124122142102).
The spelling of 20022011120100 in words is "twenty trillion, twenty-two billion, eleven million, one hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •