Base | Representation |
---|---|
bin | 11101001000100001000… |
… | …110011101110011011001 |
3 | 21002101112112012122220101 |
4 | 131020201012131303121 |
5 | 230300104041244001 |
6 | 4131413304255401 |
7 | 264432451045456 |
oct | 35104106356331 |
9 | 7071475178811 |
10 | 2002010103001 |
11 | 702058568a37 |
12 | 284005171561 |
13 | 116a33b3812c |
14 | 6cc7d81882d |
15 | 371246d8a01 |
hex | 1d22119dcd9 |
2002010103001 has 2 divisors, whose sum is σ = 2002010103002. Its totient is φ = 2002010103000.
The previous prime is 2002010102977. The next prime is 2002010103011. The reversal of 2002010103001 is 1003010102002.
It is an a-pointer prime, because the next prime (2002010103011) can be obtained adding 2002010103001 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1294359014601 + 707651088400 = 1137699^2 + 841220^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002010103001 - 225 = 2001976548569 is a prime.
It is not a weakly prime, because it can be changed into another prime (2002010103011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001005051500 + 1001005051501.
It is an arithmetic number, because the mean of its divisors is an integer number (1001005051501).
Almost surely, 22002010103001 is an apocalyptic number.
It is an amenable number.
2002010103001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002010103001 is an equidigital number, since it uses as much as digits as its factorization.
2002010103001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 2002010103001 its reverse (1003010102002), we get a palindrome (3005020205003).
Subtracting from 2002010103001 its reverse (1003010102002), we obtain a palindrome (999000000999).
The spelling of 2002010103001 in words is "two trillion, two billion, ten million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •