Base | Representation |
---|---|
bin | 11001010000101110000010… |
… | …100101110111101011100101 |
3 | 112120101001210200121200201100 |
4 | 121100232002211313223211 |
5 | 104030231011130323414 |
6 | 1032142404055150313 |
7 | 32254501203363312 |
oct | 3120560245675345 |
9 | 476331720550640 |
10 | 111100110011109 |
11 | 3244432380015a |
12 | 10563b42075399 |
13 | 49cb906ab6b5b |
14 | 1d613b9c83d09 |
15 | cc9e7eb94609 |
hex | 650b82977ae5 |
111100110011109 has 24 divisors (see below), whose sum is σ = 169935665739840. Its totient is φ = 69748319913408.
The previous prime is 111100110011101. The next prime is 111100110011129. The reversal of 111100110011109 is 901110011001111.
It is not a de Polignac number, because 111100110011109 - 23 = 111100110011101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111100110011091 and 111100110011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100110011101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1945205712 + ... + 1945262825.
It is an arithmetic number, because the mean of its divisors is an integer number (7080652739160).
Almost surely, 2111100110011109 is an apocalyptic number.
111100110011109 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
111100110011109 is a deficient number, since it is larger than the sum of its proper divisors (58835555728731).
111100110011109 is a wasteful number, since it uses less digits than its factorization.
111100110011109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3890468729 (or 3890468726 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 111100110011109 in words is "one hundred eleven trillion, one hundred billion, one hundred ten million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •