Base | Representation |
---|---|
bin | 1010000110011111110101… |
… | …0101100000100010011111 |
3 | 1110022210102212011210102001 |
4 | 2201213331111200202133 |
5 | 2423433101111442421 |
6 | 35342211035543131 |
7 | 2224302250355011 |
oct | 241477525404237 |
9 | 43283385153361 |
10 | 11106740734111 |
11 | 35a2384657350 |
12 | 12b4688bbaaa7 |
13 | 627490601659 |
14 | 2a57d79441b1 |
15 | 143da2598691 |
hex | a19fd56089f |
11106740734111 has 16 divisors (see below), whose sum is σ = 12444785981568. Its totient is φ = 9823457239200.
The previous prime is 11106740734073. The next prime is 11106740734123. The reversal of 11106740734111 is 11143704760111.
It is not a de Polignac number, because 11106740734111 - 213 = 11106740725919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11106740737111) 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 15 ways as a sum of consecutive naturals, for example, 4918456 + ... + 6812098.
It is an arithmetic number, because the mean of its divisors is an integer number (777799123848).
Almost surely, 211106740734111 is an apocalyptic number.
11106740734111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11106740734111 is a deficient number, since it is larger than the sum of its proper divisors (1338045247457).
11106740734111 is a wasteful number, since it uses less digits than its factorization.
11106740734111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1908102.
The product of its (nonzero) digits is 14112, while the sum is 37.
The spelling of 11106740734111 in words is "eleven trillion, one hundred six billion, seven hundred forty million, seven hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •