Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …001111011010010101001 |
3 | 21002101112120220202100222 |
4 | 131020201021323102221 |
5 | 230300104304311332 |
6 | 4131413335535425 |
7 | 264432461544431 |
oct | 35104111732251 |
9 | 7071476822328 |
10 | 2002011010217 |
11 | 7020590285a9 |
12 | 28400552a575 |
13 | 116a3409504a |
14 | 6cc7d9b32c1 |
15 | 37124817712 |
hex | 1d22127b4a9 |
2002011010217 has 2 divisors, whose sum is σ = 2002011010218. Its totient is φ = 2002011010216.
The previous prime is 2002011010187. The next prime is 2002011010289. The reversal of 2002011010217 is 7120101102002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1680313320361 + 321697689856 = 1296269^2 + 567184^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002011010217 - 214 = 2002010993833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002011010195 and 2002011010204.
It is not a weakly prime, because it can be changed into another prime (2002011015217) 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, 1001005505108 + 1001005505109.
It is an arithmetic number, because the mean of its divisors is an integer number (1001005505109).
Almost surely, 22002011010217 is an apocalyptic number.
It is an amenable number.
2002011010217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002011010217 is an equidigital number, since it uses as much as digits as its factorization.
2002011010217 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 17.
Adding to 2002011010217 its reverse (7120101102002), we get a palindrome (9122112112219).
The spelling of 2002011010217 in words is "two trillion, two billion, eleven million, ten thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •