Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …01111010010101110110101 |
3 | 2212222021200111201001211202 |
4 | 11000131212233102232311 |
5 | 10341302044334000432 |
6 | 114500435441342245 |
7 | 4432016131651325 |
oct | 500354657225665 |
9 | 85867614631752 |
10 | 22022021000117 |
11 | 7020539818176 |
12 | 2578022337985 |
13 | c3988ab40798 |
14 | 561c2b597285 |
15 | 282c9b23e462 |
hex | 140766bd2bb5 |
22022021000117 has 2 divisors, whose sum is σ = 22022021000118. Its totient is φ = 22022021000116.
The previous prime is 22022021000071. The next prime is 22022021000141. The reversal of 22022021000117 is 71100012022022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19914852311236 + 2107168688881 = 4462606^2 + 1451609^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022021000117 - 210 = 22022020999093 is a prime.
It is a super-3 number, since 3×220220210001173 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22022021000717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011010500058 + 11011010500059.
It is an arithmetic number, because the mean of its divisors is an integer number (11011010500059).
Almost surely, 222022021000117 is an apocalyptic number.
It is an amenable number.
22022021000117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022021000117 is an equidigital number, since it uses as much as digits as its factorization.
22022021000117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 22022021000117 its reverse (71100012022022), we get a palindrome (93122033022139).
The spelling of 22022021000117 in words is "twenty-two trillion, twenty-two billion, twenty-one million, one hundred seventeen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •