Base | Representation |
---|---|
bin | 11101010000000011010… |
… | …110110010111100010001 |
3 | 21010011102101122220210022 |
4 | 131100003112302330101 |
5 | 230413141324031001 |
6 | 4135232212313225 |
7 | 265140114414341 |
oct | 35200326627421 |
9 | 7104371586708 |
10 | 2010101002001 |
11 | 70552a681124 |
12 | 2856a2912815 |
13 | 117723156431 |
14 | 6d40a1c4d21 |
15 | 37449b8c11b |
hex | 1d4035b2f11 |
2010101002001 has 8 divisors (see below), whose sum is σ = 2115917044800. Its totient is φ = 1904287084560.
The previous prime is 2010101001977. The next prime is 2010101002051. The reversal of 2010101002001 is 1002001010102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010101002001 - 238 = 1735223095057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010101002001.
It is not an unprimeable number, because it can be changed into a prime (2010101002051) 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 in 7 ways as a sum of consecutive naturals, for example, 1636895 + ... + 2588363.
It is an arithmetic number, because the mean of its divisors is an integer number (264489630600).
Almost surely, 22010101002001 is an apocalyptic number.
It is an amenable number.
2010101002001 is a deficient number, since it is larger than the sum of its proper divisors (105816042799).
2010101002001 is a wasteful number, since it uses less digits than its factorization.
2010101002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062679.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2010101002001 its reverse (1002001010102), we get a palindrome (3012102012103).
The spelling of 2010101002001 in words is "two trillion, ten billion, one hundred one million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •