Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1001100110011000001111 |
3 | 1102222122100021211001022210 |
4 | 2200032303121212120033 |
5 | 2420401022304341421 |
6 | 35230215535441503 |
7 | 2214343055222415 |
oct | 240166331463017 |
9 | 42878307731283 |
10 | 11011011012111 |
11 | 356581a729320 |
12 | 129a011386293 |
13 | 61b445705b36 |
14 | 2a0d15ab12b5 |
15 | 14164d1c1576 |
hex | a03b366660f |
11011011012111 has 32 divisors (see below), whose sum is σ = 16325755358976. Its totient is φ = 6545516960000.
The previous prime is 11011011012007. The next prime is 11011011012119. The reversal of 11011011012111 is 11121011011011.
It is a cyclic number.
It is not a de Polignac number, because 11011011012111 - 211 = 11011011010063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011011012119) 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, 15080910 + ... + 15794171.
It is an arithmetic number, because the mean of its divisors is an integer number (510179854968).
Almost surely, 211011011012111 is an apocalyptic number.
11011011012111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11011011012111 is a deficient number, since it is larger than the sum of its proper divisors (5314744346865).
11011011012111 is a wasteful number, since it uses less digits than its factorization.
11011011012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30875303.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 11011011012111 its reverse (11121011011011), we get a palindrome (22132022023122).
The spelling of 11011011012111 in words is "eleven trillion, eleven billion, eleven million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •