Base | Representation |
---|---|
bin | 1001001001100110101010… |
… | …00010110100010110111100 |
3 | 2122020120100002201022220112 |
4 | 10210303111002310112330 |
5 | 10114131204440201340 |
6 | 110443315134205152 |
7 | 4144465056254123 |
oct | 444632502642674 |
9 | 78216302638815 |
10 | 20121201100220 |
11 | 645839850a570 |
12 | 230b7596537b8 |
13 | b2c56228929c |
14 | 4d7c2acdcaba |
15 | 24d5ea4e3065 |
hex | 124cd50b45bc |
20121201100220 has 24 divisors (see below), whose sum is σ = 46095842521008. Its totient is φ = 7316800400000.
The previous prime is 20121201100171. The next prime is 20121201100249. The reversal of 20121201100220 is 2200110212102.
It is a junction number, because it is equal to n+sod(n) for n = 20121201100195 and 20121201100204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45730002281 + ... + 45730002720.
It is an arithmetic number, because the mean of its divisors is an integer number (1920660105042).
Almost surely, 220121201100220 is an apocalyptic number.
20121201100220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20121201100220 is an abundant number, since it is smaller than the sum of its proper divisors (25974641420788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20121201100220 is a wasteful number, since it uses less digits than its factorization.
20121201100220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91460005021 (or 91460005019 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20121201100220 its reverse (2200110212102), we get a palindrome (22321311312322).
The spelling of 20121201100220 in words is "twenty trillion, one hundred twenty-one billion, two hundred one million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •