Base | Representation |
---|---|
bin | 1001001001100100110101… |
… | …00100100110011001101000 |
3 | 2122020110210201210100212110 |
4 | 10210302122210212121220 |
5 | 10114122202321201300 |
6 | 110443033532042320 |
7 | 4144431545015553 |
oct | 444623244463150 |
9 | 78213721710773 |
10 | 20120220100200 |
11 | 6457a34793750 |
12 | 230b5250033a0 |
13 | b2c436c722bc |
14 | 4d7b768d969a |
15 | 24d58e316550 |
hex | 124c9a926668 |
20120220100200 has 192 divisors, whose sum is σ = 68045412225600. Its totient is φ = 4877450905600.
The previous prime is 20120220100157. The next prime is 20120220100231. The reversal of 20120220100200 is 200102202102.
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 (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 319494316 + ... + 319557284.
It is an arithmetic number, because the mean of its divisors is an integer number (354403188675).
Almost surely, 220120220100200 is an apocalyptic number.
20120220100200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20120220100200 is an abundant number, since it is smaller than the sum of its proper divisors (47925192125400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20120220100200 is a wasteful number, since it uses less digits than its factorization.
20120220100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111412 (or 111403 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20120220100200 its reverse (200102202102), we get a palindrome (20320322302302).
The spelling of 20120220100200 in words is "twenty trillion, one hundred twenty billion, two hundred twenty million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •