Base | Representation |
---|---|
bin | 11101010000000011011… |
… | …010101001000101100011 |
3 | 21010011102110120010210102 |
4 | 131100003122221011203 |
5 | 230413142103311321 |
6 | 4135232250053015 |
7 | 265140126113621 |
oct | 35200332510543 |
9 | 7104373503712 |
10 | 2010102010211 |
11 | 7055301aa659 |
12 | 2856a311a16b |
13 | 11772341a2c9 |
14 | 6d40a3a8511 |
15 | 37449cdac0b |
hex | 1d4036a9163 |
2010102010211 has 8 divisors (see below), whose sum is σ = 2058680184000. Its totient is φ = 1961607091752.
The previous prime is 2010102010193. The next prime is 2010102010229. The reversal of 2010102010211 is 1120102010102.
It is an interprime number because it is at equal distance from previous prime (2010102010193) and next prime (2010102010229).
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 2010102010211 - 210 = 2010102009187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010102010192 and 2010102010201.
It is not an unprimeable number, because it can be changed into a prime (2010102010811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20764961 + ... + 20861538.
It is an arithmetic number, because the mean of its divisors is an integer number (257335023000).
Almost surely, 22010102010211 is an apocalyptic number.
2010102010211 is a deficient number, since it is larger than the sum of its proper divisors (48578173789).
2010102010211 is a wasteful number, since it uses less digits than its factorization.
2010102010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41627665.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2010102010211 its reverse (1120102010102), we get a palindrome (3130204020313).
The spelling of 2010102010211 in words is "two trillion, ten billion, one hundred two million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •