Base | Representation |
---|---|
bin | 110010000100101001101110… |
… | …000101010001011101101001 |
3 | 1001212202000110211021121102222 |
4 | 302010221232011101131221 |
5 | 212331104124000323423 |
6 | 2100212331250203425 |
7 | 64246341312316502 |
oct | 6204515605213551 |
9 | 1055660424247388 |
10 | 220222000011113 |
11 | 64195697915551 |
12 | 208485ba283575 |
13 | 95b5acb718b29 |
14 | 3c54b31b07ba9 |
15 | 1a6d72d9cb3c8 |
hex | c84a6e151769 |
220222000011113 has 2 divisors, whose sum is σ = 220222000011114. Its totient is φ = 220222000011112.
The previous prime is 220222000011071. The next prime is 220222000011269. The reversal of 220222000011113 is 311110000222022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 165535191138304 + 54686808872809 = 12866048^2 + 7395053^2 .
It is a cyclic number.
It is not a de Polignac number, because 220222000011113 - 214 = 220221999994729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220222000011091 and 220222000011100.
It is not a weakly prime, because it can be changed into another prime (220222000311113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110111000005556 + 110111000005557.
It is an arithmetic number, because the mean of its divisors is an integer number (110111000005557).
Almost surely, 2220222000011113 is an apocalyptic number.
It is an amenable number.
220222000011113 is a deficient number, since it is larger than the sum of its proper divisors (1).
220222000011113 is an equidigital number, since it uses as much as digits as its factorization.
220222000011113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 220222000011113 its reverse (311110000222022), we get a palindrome (531332000233135).
The spelling of 220222000011113 in words is "two hundred twenty trillion, two hundred twenty-two billion, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •