Base | Representation |
---|---|
bin | 11101010000111000111… |
… | …100101010001011001011 |
3 | 21010020202001111211211100 |
4 | 131100320330222023023 |
5 | 230422012012320021 |
6 | 4135501331432443 |
7 | 265201312660551 |
oct | 35207074521313 |
9 | 7106661454740 |
10 | 2011000120011 |
11 | 705951160863 |
12 | 2858b3a55723 |
13 | 11783750151c |
14 | 6d493791bd1 |
15 | 3749da92626 |
hex | 1d438f2a2cb |
2011000120011 has 6 divisors (see below), whose sum is σ = 2904777951140. Its totient is φ = 1340666746668.
The previous prime is 2011000120009. The next prime is 2011000120091. The reversal of 2011000120011 is 1100210001102.
It is a happy number.
It is not a de Polignac number, because 2011000120011 - 21 = 2011000120009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 223444457779 = 2011000120011 / (2 + 0 + 1 + 1 + 0 + 0 + 0 + 1 + 2 + 0 + 0 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011000119975 and 2011000120002.
It is not an unprimeable number, because it can be changed into a prime (2011000120091) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 111722228881 + ... + 111722228898.
Almost surely, 22011000120011 is an apocalyptic number.
2011000120011 is a deficient number, since it is larger than the sum of its proper divisors (893777831129).
2011000120011 is a wasteful number, since it uses less digits than its factorization.
2011000120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223444457785 (or 223444457782 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2011000120011 its reverse (1100210001102), we get a palindrome (3111210121113).
The spelling of 2011000120011 in words is "two trillion, eleven billion, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •