Base | Representation |
---|---|
bin | 110011101100000011… |
… | …1011001101001010101 |
3 | 101121111210002022000012 |
4 | 1213120013121221111 |
5 | 3304312000013414 |
6 | 122554231130005 |
7 | 11006453304404 |
oct | 1473007315125 |
9 | 347453068005 |
10 | 111000001109 |
11 | 43090674808 |
12 | 19619813905 |
13 | a60c73773a |
14 | 552dd3163b |
15 | 2d49cc933e |
hex | 19d81d9a55 |
111000001109 has 12 divisors (see below), whose sum is σ = 113105757996. Its totient is φ = 108932608128.
The previous prime is 111000001081. The next prime is 111000001171. The reversal of 111000001109 is 901100000111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 72700336900 + 38299664209 = 269630^2 + 195703^2 .
It is a de Polignac number, because none of the positive numbers 2k-111000001109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111000001093 and 111000001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000001709) 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, 2037347 + ... + 2091119.
It is an arithmetic number, because the mean of its divisors is an integer number (9425479833).
Almost surely, 2111000001109 is an apocalyptic number.
It is an amenable number.
111000001109 is a deficient number, since it is larger than the sum of its proper divisors (2105756887).
111000001109 is an frugal number, since it uses more digits than its factorization.
111000001109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54484 (or 54425 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 111000001109 in words is "one hundred eleven billion, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •