Base | Representation |
---|---|
bin | 100000000001111011110… |
… | …010111111011001100001 |
3 | 21210102102110101111120102 |
4 | 200001323302333121201 |
5 | 242030323124020001 |
6 | 4403101012352145 |
7 | 315011213112404 |
oct | 40017362773141 |
9 | 7712373344512 |
10 | 2201100220001 |
11 | 779532767611 |
12 | 2b6708015655 |
13 | 12c7417b03a7 |
14 | 78768b29d3b |
15 | 3c3c7d2ce6b |
hex | 2007bcbf661 |
2201100220001 has 2 divisors, whose sum is σ = 2201100220002. Its totient is φ = 2201100220000.
The previous prime is 2201100219883. The next prime is 2201100220009. The reversal of 2201100220001 is 1000220011022.
It is a happy number.
2201100220001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1984368072976 + 216732147025 = 1408676^2 + 465545^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201100220001 is a prime.
It is not a weakly prime, because it can be changed into another prime (2201100220009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100550110000 + 1100550110001.
It is an arithmetic number, because the mean of its divisors is an integer number (1100550110001).
Almost surely, 22201100220001 is an apocalyptic number.
It is an amenable number.
2201100220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201100220001 is an equidigital number, since it uses as much as digits as its factorization.
2201100220001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2201100220001 its reverse (1000220011022), we get a palindrome (3201320231023).
The spelling of 2201100220001 in words is "two trillion, two hundred one billion, one hundred million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •