Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …1000111011101011101111 |
3 | 1110022100111012202000220212 |
4 | 2201203221120323223233 |
5 | 2423344110421320421 |
6 | 35340123415133035 |
7 | 2224046443322054 |
oct | 241435130735357 |
9 | 43270435660825 |
10 | 11102111120111 |
11 | 35a0419328880 |
12 | 12b37b667417b |
13 | 626c03415c9b |
14 | 2a54b8b3902b |
15 | 143bd0e05e5b |
hex | a18e963baef |
11102111120111 has 8 divisors (see below), whose sum is σ = 12113136930000. Its totient is φ = 10091375807040.
The previous prime is 11102111120039. The next prime is 11102111120117.
11102111120111 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11102111120111 - 242 = 6704064609007 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 (11102111120117) 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, 72544286 + ... + 72697163.
It is an arithmetic number, because the mean of its divisors is an integer number (1514142116250).
Almost surely, 211102111120111 is an apocalyptic number.
11102111120111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11102111120111 is a deficient number, since it is larger than the sum of its proper divisors (1011025809889).
11102111120111 is a wasteful number, since it uses less digits than its factorization.
11102111120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145248409.
The product of its (nonzero) digits is 4, while the sum is 14.
It can be divided in two parts, 1110211 and 1120111, that multiplied together give a palindrome (1243559553421).
The spelling of 11102111120111 in words is "eleven trillion, one hundred two billion, one hundred eleven million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •