Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …011110100100001011001 |
3 | 21002101111220010020202121 |
4 | 131020200203310201121 |
5 | 230300044230133032 |
6 | 4131412341501241 |
7 | 264432310621414 |
oct | 35104043644131 |
9 | 7071456106677 |
10 | 2002001021017 |
11 | 702053425568 |
12 | 284002111821 |
13 | 116a31ca838a |
14 | 6cc7c532b7b |
15 | 371239e2a97 |
hex | 1d2208f4859 |
2002001021017 has 2 divisors, whose sum is σ = 2002001021018. Its totient is φ = 2002001021016.
The previous prime is 2002001020979. The next prime is 2002001021021. The reversal of 2002001021017 is 7101201002002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1575567206656 + 426433814361 = 1255216^2 + 653019^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002001021017 is a prime.
It is a super-2 number, since 2×20020010210172 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002001021117) 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, 1001000510508 + 1001000510509.
It is an arithmetic number, because the mean of its divisors is an integer number (1001000510509).
Almost surely, 22002001021017 is an apocalyptic number.
It is an amenable number.
2002001021017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002001021017 is an equidigital number, since it uses as much as digits as its factorization.
2002001021017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 16.
Adding to 2002001021017 its reverse (7101201002002), we get a palindrome (9103202023019).
The spelling of 2002001021017 in words is "two trillion, two billion, one million, twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •