Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …1000010010101111101111 |
3 | 1102221200210102021211022212 |
4 | 2200011211120102233233 |
5 | 2420220234200041421 |
6 | 35221501404001035 |
7 | 2213542546033562 |
oct | 240054530225757 |
9 | 42850712254285 |
10 | 11001112112111 |
11 | 35615aaa97230 |
12 | 129810a23017b |
13 | 61a528955a64 |
14 | 2a06571484d9 |
15 | 14126e133e5b |
hex | a0165612bef |
11001112112111 has 8 divisors (see below), whose sum is σ = 12034642780800. Its totient is φ = 9973153038040.
The previous prime is 11001112112077. The next prime is 11001112112117. The reversal of 11001112112111 is 11121121110011.
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 11001112112111 - 26 = 11001112112047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001112112117) 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, 1392894521 + ... + 1392902418.
It is an arithmetic number, because the mean of its divisors is an integer number (1504330347600).
Almost surely, 211001112112111 is an apocalyptic number.
11001112112111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11001112112111 is a deficient number, since it is larger than the sum of its proper divisors (1033530668689).
11001112112111 is a wasteful number, since it uses less digits than its factorization.
11001112112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2785797309.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 11001112112111 its reverse (11121121110011), we get a palindrome (22122233222122).
The spelling of 11001112112111 in words is "eleven trillion, one billion, one hundred twelve million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •