Base | Representation |
---|---|
bin | 11101010001110100100… |
… | …110101110001000011010 |
3 | 21010100022210211220211000 |
4 | 131101310212232020122 |
5 | 230431034224031020 |
6 | 4140144524045430 |
7 | 265235155224066 |
oct | 35216446561032 |
9 | 7110283756730 |
10 | 2012001002010 |
11 | 70631512726a |
12 | 285b33093876 |
13 | 117966989cac |
14 | 6d54a68caa6 |
15 | 3750b89a090 |
hex | 1d4749ae21a |
2012001002010 has 32 divisors (see below), whose sum is σ = 5365336006080. Its totient is φ = 536533600464.
The previous prime is 2012001002003. The next prime is 2012001002017. The reversal of 2012001002010 is 102001002102.
It is an interprime number because it is at equal distance from previous prime (2012001002003) and next prime (2012001002017).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2012001001983 and 2012001002001.
It is not an unprimeable number, because it can be changed into a prime (2012001002017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3725927512 + ... + 3725928051.
It is an arithmetic number, because the mean of its divisors is an integer number (167666750190).
Almost surely, 22012001002010 is an apocalyptic number.
2012001002010 is an abundant number, since it is smaller than the sum of its proper divisors (3353335004070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012001002010 is a wasteful number, since it uses less digits than its factorization.
2012001002010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7451855579 (or 7451855573 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2012001002010 its reverse (102001002102), we get a palindrome (2114002004112).
The spelling of 2012001002010 in words is "two trillion, twelve billion, one million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •