Base | Representation |
---|---|
bin | 110010000100100111111110… |
… | …000101011010100010101110 |
3 | 1001212201211121212120221220212 |
4 | 302010213332011122202232 |
5 | 212331041301434000420 |
6 | 2100211421004342422 |
7 | 64246243615065350 |
oct | 6204477605324256 |
9 | 1055654555527825 |
10 | 220220121000110 |
11 | 641949131a57a0 |
12 | 20848174b44a12 |
13 | 95b588c3538ba |
14 | 3c549d43450d0 |
15 | 1a6d66da673c5 |
hex | c849fe15a8ae |
220220121000110 has 64 divisors (see below), whose sum is σ = 515695587738624. Its totient is φ = 65655688243200.
The previous prime is 220220120999993. The next prime is 220220121000127. The reversal of 220220121000110 is 11000121022022.
220220121000110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6217377011 + ... + 6217412430.
It is an arithmetic number, because the mean of its divisors is an integer number (8057743558416).
Almost surely, 2220220121000110 is an apocalyptic number.
220220121000110 is an abundant number, since it is smaller than the sum of its proper divisors (295475466738514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220220121000110 is a wasteful number, since it uses less digits than its factorization.
220220121000110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12434789489.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220220121000110 its reverse (11000121022022), we get a palindrome (231220242022132).
The spelling of 220220121000110 in words is "two hundred twenty trillion, two hundred twenty billion, one hundred twenty-one million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •