Base | Representation |
---|---|
bin | 11101010000111001100… |
… | …010010110100001110011 |
3 | 21010020202202002212000022 |
4 | 131100321202112201303 |
5 | 230422022030013021 |
6 | 4135502323314055 |
7 | 265201462653254 |
oct | 35207142264163 |
9 | 7106682085008 |
10 | 2011010001011 |
11 | 70595679a580 |
12 | 2858b721b92b |
13 | 117839580b7b |
14 | 6d494c04b2b |
15 | 3749e8951ab |
hex | 1d439896873 |
2011010001011 has 8 divisors (see below), whose sum is σ = 2209612036800. Its totient is φ = 1815038456040.
The previous prime is 2011010001001. The next prime is 2011010001071. The reversal of 2011010001011 is 1101000101102.
It is a happy number.
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 2011010001011 - 222 = 2011005806707 is a prime.
It is a super-2 number, since 2×20110100010112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011010001011.
It is not an unprimeable number, because it can be changed into a prime (2011010001001) 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, 657621101 + ... + 657624158.
It is an arithmetic number, because the mean of its divisors is an integer number (276201504600).
Almost surely, 22011010001011 is an apocalyptic number.
2011010001011 is a deficient number, since it is larger than the sum of its proper divisors (198602035789).
2011010001011 is a wasteful number, since it uses less digits than its factorization.
2011010001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1315245409.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 2011010001011 its reverse (1101000101102), we get a palindrome (3112010102113).
The spelling of 2011010001011 in words is "two trillion, eleven billion, ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •