Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0101010110100101011110 |
3 | 1110022011022010112221120000 |
4 | 2201201301211112211132 |
5 | 2423331001341010420 |
6 | 35335152133435130 |
7 | 2223645565446435 |
oct | 241416145264536 |
9 | 43264263487500 |
10 | 11100101110110 |
11 | 359a587774591 |
12 | 12b333549baa6 |
13 | 626972b7565c |
14 | 2a5367bd611c |
15 | 143b14717690 |
hex | a187195695e |
11100101110110 has 80 divisors (see below), whose sum is σ = 29941093613376. Its totient is φ = 2950689269952.
The previous prime is 11100101110051. The next prime is 11100101110123. The reversal of 11100101110110 is 1101110100111.
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 = 11100101110092 and 11100101110101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 21358102 + ... + 21871641.
Almost surely, 211100101110110 is an apocalyptic number.
11100101110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11100101110110 is an abundant number, since it is smaller than the sum of its proper divisors (18840992503266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100101110110 is a wasteful number, since it uses less digits than its factorization.
11100101110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43230079 (or 43230070 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11100101110110 its reverse (1101110100111), we get a palindrome (12201211210221).
The spelling of 11100101110110 in words is "eleven trillion, one hundred billion, one hundred one million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •