Base | Representation |
---|---|
bin | 1010000110110000000100… |
… | …1011001101010100011101 |
3 | 1110100012200200010001001100 |
4 | 2201230001023031110131 |
5 | 2424021013112010414 |
6 | 35344211404303313 |
7 | 2224515263426016 |
oct | 241540113152435 |
9 | 43305620101040 |
10 | 11111100110109 |
11 | 35a421138a02a |
12 | 12b54a4b41b39 |
13 | 627a0680ca8c |
14 | 2a5acc8c600d |
15 | 14405a15a609 |
hex | a1b012cd51d |
11111100110109 has 12 divisors (see below), whose sum is σ = 16050026605756. Its totient is φ = 7407095559552.
The previous prime is 11111100110051. The next prime is 11111100110111. The reversal of 11111100110109 is 90101100111111.
It can be written as a sum of positive squares in 2 ways, for example, as 10649485856025 + 461614254084 = 3263355^2 + 679422^2 .
It is not a de Polignac number, because 11111100110109 - 27 = 11111100109981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11111100110091 and 11111100110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11111100110119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25144954 + ... + 25583019.
Almost surely, 211111100110109 is an apocalyptic number.
It is an amenable number.
11111100110109 is a deficient number, since it is larger than the sum of its proper divisors (4938926495647).
11111100110109 is a wasteful number, since it uses less digits than its factorization.
11111100110109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50752316 (or 50752313 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 11111100110109 in words is "eleven trillion, one hundred eleven billion, one hundred million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •