Base | Representation |
---|---|
bin | 100000000000111010010… |
… | …010101000110110110101 |
3 | 21210022120212102112000110 |
4 | 200000322102220312311 |
5 | 242021100303020041 |
6 | 4402355553133233 |
7 | 314642036553003 |
oct | 40007222506665 |
9 | 7708525375013 |
10 | 2200001220021 |
11 | 779019375670 |
12 | 2b645bb5a219 |
13 | 12c5c7bbc947 |
14 | 786a2baba73 |
15 | 3c3615e3516 |
hex | 2003a4a8db5 |
2200001220021 has 48 divisors (see below), whose sum is σ = 3394919098368. Its totient is φ = 1255448894400.
The previous prime is 2200001219917. The next prime is 2200001220023. The reversal of 2200001220021 is 1200221000022.
It is not a de Polignac number, because 2200001220021 - 27 = 2200001219893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200001219979 and 2200001220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200001220023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 615046 + ... + 2185928.
It is an arithmetic number, because the mean of its divisors is an integer number (70727481216).
Almost surely, 22200001220021 is an apocalyptic number.
It is an amenable number.
2200001220021 is a deficient number, since it is larger than the sum of its proper divisors (1194917878347).
2200001220021 is a wasteful number, since it uses less digits than its factorization.
2200001220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571002 (or 1570965 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2200001220021 its reverse (1200221000022), we get a palindrome (3400222220043).
The spelling of 2200001220021 in words is "two trillion, two hundred billion, one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •