Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111111011011000111011 |
3 | 21010011012010112111112011 |
4 | 131033331333323120323 |
5 | 230413000321334321 |
6 | 4135215242030351 |
7 | 265134643426252 |
oct | 35177577733073 |
9 | 7104163474464 |
10 | 2010011121211 |
11 | 705493971385 |
12 | 2856787a83b7 |
13 | 11770a646832 |
14 | 6d3dc2a9799 |
15 | 37441d35ae1 |
hex | 1d3fdffb63b |
2010011121211 has 4 divisors (see below), whose sum is σ = 2021240233800. Its totient is φ = 1998782008624.
The previous prime is 2010011121199. The next prime is 2010011121229. The reversal of 2010011121211 is 1121211100102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2010011121211 - 221 = 2010009024059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010011121191 and 2010011121200.
It is not an unprimeable number, because it can be changed into a prime (2010011121241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5614556026 + ... + 5614556383.
It is an arithmetic number, because the mean of its divisors is an integer number (505310058450).
Almost surely, 22010011121211 is an apocalyptic number.
2010011121211 is a deficient number, since it is larger than the sum of its proper divisors (11229112589).
2010011121211 is a wasteful number, since it uses less digits than its factorization.
2010011121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11229112588.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2010011121211 its reverse (1121211100102), we get a palindrome (3131222221313).
The spelling of 2010011121211 in words is "two trillion, ten billion, eleven million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •