Base | Representation |
---|---|
bin | 110010000001101111101001… |
… | …101010110111010101011110 |
3 | 1001212000220210010010110211222 |
4 | 302001233221222313111132 |
5 | 212314320441230001342 |
6 | 2055540450301013342 |
7 | 64226036321252600 |
oct | 6201575152672536 |
9 | 1055026703113758 |
10 | 220022210000222 |
11 | 6411899363a273 |
12 | 20815940b54252 |
13 | 95a000ba70886 |
14 | 3c491bb889170 |
15 | 1a68438bd5ed2 |
hex | c81be9ab755e |
220022210000222 has 24 divisors (see below), whose sum is σ = 392084737238304. Its totient is φ = 92288951305152.
The previous prime is 220022210000171. The next prime is 220022210000227. The reversal of 220022210000222 is 222000012220022.
It is a super-2 number, since 2×2200222100002222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 220022210000222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220022210000227) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23884299563 + ... + 23884308774.
It is an arithmetic number, because the mean of its divisors is an integer number (16336864051596).
Almost surely, 2220022210000222 is an apocalyptic number.
220022210000222 is a deficient number, since it is larger than the sum of its proper divisors (172062527238082).
220022210000222 is a wasteful number, since it uses less digits than its factorization.
220022210000222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47768608400 (or 47768608393 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 220022210000222 its reverse (222000012220022), we get a palindrome (442022222220244).
The spelling of 220022210000222 in words is "two hundred twenty trillion, twenty-two billion, two hundred ten million, two hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •