Base | Representation |
---|---|
bin | 100000000001000111010… |
… | …101101011011110111110 |
3 | 21210100011010022211201221 |
4 | 200001013111223132332 |
5 | 242022022322333042 |
6 | 4402433413023554 |
7 | 314650335311230 |
oct | 40010725533676 |
9 | 7710133284657 |
10 | 2200220121022 |
11 | 779120998190 |
12 | 2b6501324bba |
13 | 12c631364071 |
14 | 786c3cb0250 |
15 | 3c375932d67 |
hex | 2004756b7be |
2200220121022 has 64 divisors (see below), whose sum is σ = 4206122380800. Its totient is φ = 838332334080.
The previous prime is 2200220121007. The next prime is 2200220121023. The reversal of 2200220121022 is 2201210220022.
2200220121022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 2200220120987 and 2200220121005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200220121023) 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, 1126254 + ... + 2380942.
It is an arithmetic number, because the mean of its divisors is an integer number (65720662200).
Almost surely, 22200220121022 is an apocalyptic number.
2200220121022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2200220121022 is a deficient number, since it is larger than the sum of its proper divisors (2005902259778).
2200220121022 is a wasteful number, since it uses less digits than its factorization.
2200220121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254961.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 2200220121022 its reverse (2201210220022), we get a palindrome (4401430341044).
The spelling of 2200220121022 in words is "two trillion, two hundred billion, two hundred twenty million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •