Base | Representation |
---|---|
bin | 11101001111111101010… |
… | …110010100000000101010 |
3 | 21010011011101000020220200 |
4 | 131033331112110000222 |
5 | 230412440023241020 |
6 | 4135214212133030 |
7 | 265134451622100 |
oct | 35177526240052 |
9 | 7104141006820 |
10 | 2010000212010 |
11 | 7054887a010a |
12 | 285675007176 |
13 | 1177082c719b |
14 | 6d3daa69c70 |
15 | 37440dcd590 |
hex | 1d3fd59402a |
2010000212010 has 144 divisors (see below), whose sum is σ = 6084832306176. Its totient is φ = 459004867776.
The previous prime is 2010000212009. The next prime is 2010000212023. The reversal of 2010000212010 is 102120000102.
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 = 2010000211983 and 2010000212001.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 4584019 + ... + 5003321.
It is an arithmetic number, because the mean of its divisors is an integer number (42255779904).
Almost surely, 22010000212010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2010000212010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3042416153088).
2010000212010 is an abundant number, since it is smaller than the sum of its proper divisors (4074832094166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010000212010 is a wasteful number, since it uses less digits than its factorization.
2010000212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420417 (or 420407 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2010000212010 its reverse (102120000102), we get a palindrome (2112120212112).
The spelling of 2010000212010 in words is "two trillion, ten billion, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •