Base | Representation |
---|---|
bin | 11001001111010000110100… |
… | …001110110100111111001101 |
3 | 112120000111102121212011002021 |
4 | 121033100310032310333031 |
5 | 104022111010320200414 |
6 | 1032024411240130141 |
7 | 32244325515566455 |
oct | 3117206416647715 |
9 | 476014377764067 |
10 | 111000011100109 |
11 | 3240592755782a |
12 | 10548667166951 |
13 | 49c23439554c1 |
14 | 1d5a601a36d65 |
15 | cc7571e1cc24 |
hex | 64f4343b4fcd |
111000011100109 has 4 divisors (see below), whose sum is σ = 111735110511520. Its totient is φ = 110264911688700.
The previous prime is 111000011100091. The next prime is 111000011100221. The reversal of 111000011100109 is 901001110000111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111000011100109 - 241 = 108800987844557 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111000011100092 and 111000011100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000011107109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 367549705479 + ... + 367549705780.
It is an arithmetic number, because the mean of its divisors is an integer number (27933777627880).
Almost surely, 2111000011100109 is an apocalyptic number.
It is an amenable number.
111000011100109 is a deficient number, since it is larger than the sum of its proper divisors (735099411411).
111000011100109 is an equidigital number, since it uses as much as digits as its factorization.
111000011100109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 735099411410.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 111000011100109 in words is "one hundred eleven trillion, eleven million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •