Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …100011101011101110011 |
3 | 21010011012001211022121111 |
4 | 131033331330131131303 |
5 | 230413000103242321 |
6 | 4135215210334151 |
7 | 265134632622151 |
oct | 35177574353563 |
9 | 7104161738544 |
10 | 2010010212211 |
11 | 705493400441 |
12 | 28567842a357 |
13 | 11770a3b8b71 |
14 | 6d3dc1103d1 |
15 | 37441c065e1 |
hex | 1d3fdf1d773 |
2010010212211 has 8 divisors (see below), whose sum is σ = 2207791537920. Its totient is φ = 1821428017992.
The previous prime is 2010010212179. The next prime is 2010010212233. The reversal of 2010010212211 is 1122120100102.
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 2010010212211 - 25 = 2010010212179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010010212191 and 2010010212200.
It is not an unprimeable number, because it can be changed into a prime (2010010212281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2299782415 + ... + 2299783288.
It is an arithmetic number, because the mean of its divisors is an integer number (275973942240).
Almost surely, 22010010212211 is an apocalyptic number.
2010010212211 is a deficient number, since it is larger than the sum of its proper divisors (197781325709).
2010010212211 is a wasteful number, since it uses less digits than its factorization.
2010010212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4599565745.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2010010212211 its reverse (1122120100102), we get a palindrome (3132130312313).
The spelling of 2010010212211 in words is "two trillion, ten billion, ten million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •