Base | Representation |
---|---|
bin | 1100110011101000110… |
… | …1110001001110011000 |
3 | 210000220120111002012002 |
4 | 3030322031301032120 |
5 | 12101100111120440 |
6 | 245024212340132 |
7 | 21616205212415 |
oct | 3147215611630 |
9 | 700816432162 |
10 | 220020020120 |
11 | 8534562467a |
12 | 36784314648 |
13 | 17994bb6424 |
14 | a912cd910c |
15 | 5acad47115 |
hex | 333a371398 |
220020020120 has 32 divisors (see below), whose sum is σ = 495145159200. Its totient is φ = 87990210048.
The previous prime is 220020020117. The next prime is 220020020149. The reversal of 220020020120 is 21020020022.
220020020120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 355025 + ... + 752384.
It is an arithmetic number, because the mean of its divisors is an integer number (15473286225).
Almost surely, 2220020020120 is an apocalyptic number.
220020020120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220020020120 is an abundant number, since it is smaller than the sum of its proper divisors (275125139080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220020020120 is a wasteful number, since it uses less digits than its factorization.
220020020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112387 (or 1112383 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 220020020120 its reverse (21020020022), we get a palindrome (241040040142).
The spelling of 220020020120 in words is "two hundred twenty billion, twenty million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •