Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1110000011011111100111 |
3 | 1102221200211002220202012111 |
4 | 2200011211332003133213 |
5 | 2420220244213323421 |
6 | 35221502400101451 |
7 | 2213543026132621 |
oct | 240054576033747 |
9 | 42850732822174 |
10 | 11001122011111 |
11 | 3561605638521 |
12 | 1298111604887 |
13 | 61a52aa1065b |
14 | 2a06585a3c11 |
15 | 14126ee3bee1 |
hex | a0165f837e7 |
11001122011111 has 32 divisors (see below), whose sum is σ = 12167536186368. Its totient is φ = 9893364856320.
The previous prime is 11001122011013. The next prime is 11001122011127. The reversal of 11001122011111 is 11111022110011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001122011111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001122011091 and 11001122011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001122011181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2804260596 + ... + 2804264518.
It is an arithmetic number, because the mean of its divisors is an integer number (380235505824).
Almost surely, 211001122011111 is an apocalyptic number.
11001122011111 is a deficient number, since it is larger than the sum of its proper divisors (1166414175257).
11001122011111 is a wasteful number, since it uses less digits than its factorization.
11001122011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9711.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11001122011111 its reverse (11111022110011), we get a palindrome (22112144121122).
The spelling of 11001122011111 in words is "eleven trillion, one billion, one hundred twenty-two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •