Base | Representation |
---|---|
bin | 11001010000101110000010… |
… | …101010000001110001010001 |
3 | 112120101001210202200001210000 |
4 | 121100232002222001301101 |
5 | 104030231011420213014 |
6 | 1032142404134400213 |
7 | 32254501215553002 |
oct | 3120560252016121 |
9 | 476331722601700 |
10 | 111100111101009 |
11 | 32444324384aa8 |
12 | 10563b42500069 |
13 | 49cb9070a8c74 |
14 | 1d613ba0891a9 |
15 | cc9e7ed0c509 |
hex | 650b82a81c51 |
111100111101009 has 20 divisors (see below), whose sum is σ = 165964909086900. Its totient is φ = 74066497247520.
The previous prime is 111100111100971. The next prime is 111100111101029. The reversal of 111100111101009 is 900101111001111.
It can be written as a sum of positive squares in 2 ways, for example, as 62522277852609 + 48577833248400 = 7907103^2 + 6969780^2 .
It is not a de Polignac number, because 111100111101009 - 227 = 111099976883281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111100111100982 and 111100111101000.
It is not an unprimeable number, because it can be changed into a prime (111100111101029) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 24482467 + ... + 28663415.
It is an arithmetic number, because the mean of its divisors is an integer number (8298245454345).
Almost surely, 2111100111101009 is an apocalyptic number.
It is an amenable number.
111100111101009 is a deficient number, since it is larger than the sum of its proper divisors (54864797985891).
111100111101009 is an equidigital number, since it uses as much as digits as its factorization.
111100111101009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4509022 (or 4509013 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 111100111101009 in words is "one hundred eleven trillion, one hundred billion, one hundred eleven million, one hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •