Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …1110000001111011011110 |
3 | 1110022011001212012110202200 |
4 | 2201201230032001323132 |
5 | 2423330310321010420 |
6 | 35335135200432330 |
7 | 2223643423453656 |
oct | 241415416017336 |
9 | 43264055173680 |
10 | 11100011110110 |
11 | 359a54099321a |
12 | 12b330b3186a6 |
13 | 62695a323710 |
14 | 2a5359c89366 |
15 | 143b0b88ab90 |
hex | a186c381ede |
11100011110110 has 48 divisors (see below), whose sum is σ = 31080031111584. Its totient is φ = 2732310426816.
The previous prime is 11100011110087. The next prime is 11100011110127. The reversal of 11100011110110 is 1101111000111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11100011110092 and 11100011110101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4743593322 + ... + 4743595661.
It is an arithmetic number, because the mean of its divisors is an integer number (647500648158).
Almost surely, 211100011110110 is an apocalyptic number.
11100011110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11100011110110 is an abundant number, since it is smaller than the sum of its proper divisors (19980020001474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100011110110 is a wasteful number, since it uses less digits than its factorization.
11100011110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9487189009 (or 9487189006 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11100011110110 its reverse (1101111000111), we get a palindrome (12201122110221).
The spelling of 11100011110110 in words is "eleven trillion, one hundred billion, eleven million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •