Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111111011010101110011 |
3 | 21010011012010112111020202 |
4 | 131033331333323111303 |
5 | 230413000321333021 |
6 | 4135215242025415 |
7 | 265134643425545 |
oct | 35177577732563 |
9 | 7104163474222 |
10 | 2010011121011 |
11 | 705493971213 |
12 | 2856787a826b |
13 | 11770a64670a |
14 | 6d3dc2a9695 |
15 | 37441d35a0b |
hex | 1d3fdffb573 |
2010011121011 has 4 divisors (see below), whose sum is σ = 2010016563000. Its totient is φ = 2010005679024.
The previous prime is 2010011121007. The next prime is 2010011121031. The reversal of 2010011121011 is 1101211100102.
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 2010011121011 - 22 = 2010011121007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010011120983 and 2010011121001.
It is not an unprimeable number, because it can be changed into a prime (2010011121031) 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, 2123186 + ... + 2920263.
It is an arithmetic number, because the mean of its divisors is an integer number (502504140750).
Almost surely, 22010011121011 is an apocalyptic number.
2010011121011 is a deficient number, since it is larger than the sum of its proper divisors (5441989).
2010011121011 is an equidigital number, since it uses as much as digits as its factorization.
2010011121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5441988.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2010011121011 its reverse (1101211100102), we get a palindrome (3111222221113).
The spelling of 2010011121011 in words is "two trillion, ten billion, eleven million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •