Base | Representation |
---|---|
bin | 100000000010111000000… |
… | …011001100100001011101 |
3 | 21210112000220112120122012 |
4 | 200002320003030201131 |
5 | 242034410420213041 |
6 | 4403345203201005 |
7 | 315045236342366 |
oct | 40027003144135 |
9 | 7715026476565 |
10 | 2202111101021 |
11 | 779a01342477 |
12 | 2b694a676165 |
13 | 12c87305a140 |
14 | 788230aab6d |
15 | 3c43695d3eb |
hex | 200b80cc85d |
2202111101021 has 16 divisors (see below), whose sum is σ = 2416407151536. Its totient is φ = 1994234750976.
The previous prime is 2202111101011. The next prime is 2202111101033. The reversal of 2202111101021 is 1201011112022.
It can be written as a sum of positive squares in 8 ways, for example, as 77498764996 + 2124612336025 = 278386^2 + 1457605^2 .
It is not a de Polignac number, because 2202111101021 - 26 = 2202111100957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202111100987 and 2202111101005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202111101011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11391851 + ... + 11583543.
It is an arithmetic number, because the mean of its divisors is an integer number (151025446971).
Almost surely, 22202111101021 is an apocalyptic number.
It is an amenable number.
2202111101021 is a deficient number, since it is larger than the sum of its proper divisors (214296050515).
2202111101021 is a wasteful number, since it uses less digits than its factorization.
2202111101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208432.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2202111101021 its reverse (1201011112022), we get a palindrome (3403122213043).
The spelling of 2202111101021 in words is "two trillion, two hundred two billion, one hundred eleven million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •