Base | Representation |
---|---|
bin | 11101010000111010010… |
… | …000100101010001010001 |
3 | 21010020210120220120011101 |
4 | 131100322100211101101 |
5 | 230422033130320032 |
6 | 4135503435144401 |
7 | 265202000656531 |
oct | 35207220452121 |
9 | 7106716816141 |
10 | 2011022120017 |
11 | 705962617789 |
12 | 2858bb2a5101 |
13 | 11783bc35091 |
14 | 6d49667b4c1 |
15 | 374a098ade7 |
hex | 1d43a425451 |
2011022120017 has 2 divisors, whose sum is σ = 2011022120018. Its totient is φ = 2011022120016.
The previous prime is 2011022120011. The next prime is 2011022120033. The reversal of 2011022120017 is 7100212201102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1433884107601 + 577138012416 = 1197449^2 + 759696^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011022120017 - 211 = 2011022117969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011022119976 and 2011022120003.
It is not a weakly prime, because it can be changed into another prime (2011022120011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005511060008 + 1005511060009.
It is an arithmetic number, because the mean of its divisors is an integer number (1005511060009).
Almost surely, 22011022120017 is an apocalyptic number.
It is an amenable number.
2011022120017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011022120017 is an equidigital number, since it uses as much as digits as its factorization.
2011022120017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 2011022120017 its reverse (7100212201102), we get a palindrome (9111234321119).
The spelling of 2011022120017 in words is "two trillion, eleven billion, twenty-two million, one hundred twenty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •