Base | Representation |
---|---|
bin | 100000000100101110101… |
… | …010001101111101101011 |
3 | 21210201011120222001111221 |
4 | 200010232222031331223 |
5 | 242102444331321102 |
6 | 4404314450402511 |
7 | 315145451510563 |
oct | 40045652157553 |
9 | 7721146861457 |
10 | 2204101042027 |
11 | 77a832639615 |
12 | 2b7204b90437 |
13 | 12cacc3c1b21 |
14 | 789714a7da3 |
15 | 3c5014d5637 |
hex | 2012ea8df6b |
2204101042027 has 2 divisors, whose sum is σ = 2204101042028. Its totient is φ = 2204101042026.
The previous prime is 2204101041929. The next prime is 2204101042043. The reversal of 2204101042027 is 7202401014022.
2204101042027 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 is a cyclic number.
It is not a de Polignac number, because 2204101042027 - 223 = 2204092653419 is a prime.
It is a super-2 number, since 2×22041010420272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2204101041992 and 2204101042010.
It is not a weakly prime, because it can be changed into another prime (2204101040027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1102050521013 + 1102050521014.
It is an arithmetic number, because the mean of its divisors is an integer number (1102050521014).
Almost surely, 22204101042027 is an apocalyptic number.
2204101042027 is a deficient number, since it is larger than the sum of its proper divisors (1).
2204101042027 is an equidigital number, since it uses as much as digits as its factorization.
2204101042027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 25.
Adding to 2204101042027 its reverse (7202401014022), we get a palindrome (9406502056049).
The spelling of 2204101042027 in words is "two trillion, two hundred four billion, one hundred one million, forty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •