Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …000111000010110011001 |
3 | 21010020210110002222121121 |
4 | 131100322020320112121 |
5 | 230422032121213032 |
6 | 4135503324005241 |
7 | 265201644550324 |
oct | 35207210702631 |
9 | 7106713088547 |
10 | 2011020101017 |
11 | 705961468894 |
12 | 2858ba690821 |
13 | 11783b6a90c5 |
14 | 6d4962b37bb |
15 | 374a06dca97 |
hex | 1d43a238599 |
2011020101017 has 2 divisors, whose sum is σ = 2011020101018. Its totient is φ = 2011020101016.
The previous prime is 2011020100997. The next prime is 2011020101021. The reversal of 2011020101017 is 7101010201102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1081899540736 + 929120560281 = 1040144^2 + 963909^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011020101017 is a prime.
It is not a weakly prime, because it can be changed into another prime (2011020101117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005510050508 + 1005510050509.
It is an arithmetic number, because the mean of its divisors is an integer number (1005510050509).
Almost surely, 22011020101017 is an apocalyptic number.
It is an amenable number.
2011020101017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011020101017 is an equidigital number, since it uses as much as digits as its factorization.
2011020101017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 2011020101017 its reverse (7101010201102), we get a palindrome (9112030302119).
The spelling of 2011020101017 in words is "two trillion, eleven billion, twenty million, one hundred one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •