Base | Representation |
---|---|
bin | 1010000001100100001011… |
… | …1111011111100010000101 |
3 | 1110000200201211101122102012 |
4 | 2200121002333133202011 |
5 | 2421041034031201041 |
6 | 35235235210424005 |
7 | 2215212453242615 |
oct | 240310277374205 |
9 | 43020654348365 |
10 | 11022010022021 |
11 | 356a454350259 |
12 | 12a0180a32005 |
13 | 61c4a937491b |
14 | 2a167a7a4a45 |
15 | 141a93b173eb |
hex | a0642fdf885 |
11022010022021 has 2 divisors, whose sum is σ = 11022010022022. Its totient is φ = 11022010022020.
The previous prime is 11022010021991. The next prime is 11022010022039. The reversal of 11022010022021 is 12022001022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8717197200100 + 2304812821921 = 2952490^2 + 1518161^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022010022021 - 218 = 11022009759877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11022010021987 and 11022010022005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022010021021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511005011010 + 5511005011011.
It is an arithmetic number, because the mean of its divisors is an integer number (5511005011011).
Almost surely, 211022010022021 is an apocalyptic number.
It is an amenable number.
11022010022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022010022021 is an equidigital number, since it uses as much as digits as its factorization.
11022010022021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11022010022021 its reverse (12022001022011), we get a palindrome (23044011044032).
The spelling of 11022010022021 in words is "eleven trillion, twenty-two billion, ten million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •