Base | Representation |
---|---|
bin | 11101010000111111100… |
… | …000001101000001110111 |
3 | 21010021000201110110112102 |
4 | 131100333200031001313 |
5 | 230422223141213421 |
6 | 4135520301012315 |
7 | 265204116543266 |
oct | 35207740150167 |
9 | 7107021413472 |
10 | 2011110101111 |
11 | 7059a824a231 |
12 | 28592485409b |
13 | 11785422b0b7 |
14 | 6d4a42205dd |
15 | 374a856960b |
hex | 1d43f80d077 |
2011110101111 has 32 divisors (see below), whose sum is σ = 2184024338496. Its totient is φ = 1844902656000.
The previous prime is 2011110100973. The next prime is 2011110101129. The reversal of 2011110101111 is 1111010111102.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011110101111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011110101092 and 2011110101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011110101131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53099321 + ... + 53137181.
It is an arithmetic number, because the mean of its divisors is an integer number (68250760578).
Almost surely, 22011110101111 is an apocalyptic number.
2011110101111 is a deficient number, since it is larger than the sum of its proper divisors (172914237385).
2011110101111 is a wasteful number, since it uses less digits than its factorization.
2011110101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38403.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 2011110101111 its reverse (1111010111102), we get a palindrome (3122120212213).
Subtracting from 2011110101111 its reverse (1111010111102), we obtain a palindrome (900099990009).
The spelling of 2011110101111 in words is "two trillion, eleven billion, one hundred ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •