Base | Representation |
---|---|
bin | 1001001001010101111011… |
… | …10110010110101001001110 |
3 | 2122012201011022222220111011 |
4 | 10210222331312112221032 |
5 | 10114004312314202342 |
6 | 110435232141315434 |
7 | 4144026416332141 |
oct | 444527566265116 |
9 | 78181138886434 |
10 | 20112222022222 |
11 | 6454600009350 |
12 | 2309a72565b7a |
13 | b2b760c52c95 |
14 | 4d76185b2058 |
15 | 24d27209a717 |
hex | 124abdd96a4e |
20112222022222 has 64 divisors (see below), whose sum is σ = 34882933901760. Its totient is φ = 8609721164800.
The previous prime is 20112222022219. The next prime is 20112222022223. The reversal of 20112222022222 is 22222022221102.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 20112222022193 and 20112222022202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112222022223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 139428528 + ... + 139572700.
It is an arithmetic number, because the mean of its divisors is an integer number (545045842215).
Almost surely, 220112222022222 is an apocalyptic number.
20112222022222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20112222022222 is a deficient number, since it is larger than the sum of its proper divisors (14770711879538).
20112222022222 is a wasteful number, since it uses less digits than its factorization.
20112222022222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149589.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 20112222022222 its reverse (22222022221102), we get a palindrome (42334244243324).
The spelling of 20112222022222 in words is "twenty trillion, one hundred twelve billion, two hundred twenty-two million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •