Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …001000100010100000001 |
3 | 21002012101010212002022212 |
4 | 131012221321010110001 |
5 | 230232010041231032 |
6 | 4130443021311505 |
7 | 264332054241014 |
oct | 35065171042401 |
9 | 7065333762285 |
10 | 2000010102017 |
11 | 701221620664 |
12 | 283747405595 |
13 | 1167a56904b5 |
14 | 6cb2dd5d37b |
15 | 37058d25bb2 |
hex | 1d1a9e44501 |
2000010102017 has 2 divisors, whose sum is σ = 2000010102018. Its totient is φ = 2000010102016.
The previous prime is 2000010102007. The next prime is 2000010102029. The reversal of 2000010102017 is 7102010100002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1995012177601 + 4997924416 = 1412449^2 + 70696^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000010102017 - 224 = 1999993324801 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000010101992 and 2000010102010.
It is not a weakly prime, because it can be changed into another prime (2000010102007) 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, 1000005051008 + 1000005051009.
It is an arithmetic number, because the mean of its divisors is an integer number (1000005051009).
Almost surely, 22000010102017 is an apocalyptic number.
It is an amenable number.
2000010102017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000010102017 is an equidigital number, since it uses as much as digits as its factorization.
2000010102017 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 14.
Adding to 2000010102017 its reverse (7102010100002), we get a palindrome (9102020202019).
The spelling of 2000010102017 in words is "two trillion, ten million, one hundred two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •