1100110011109 has 2 divisors, whose sum is σ = 1100110011110. Its totient is φ = 1100110011108.

The previous prime is 1100110011083. The next prime is 1100110011113. The reversal of 1100110011109 is 9011100110011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 694472222500 + 405637788609 = 833350^2 + 636897^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100110011109 - 2⁷ = 1100110010981 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1100110011092 and 1100110011101.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1100110012109) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055005554 + 550055005555.

It is an arithmetic number, because the mean of its divisors is an integer number (550055005555).

Almost surely, 2^{1100110011109} is an apocalyptic number.

It is an amenable number.

1100110011109 is a deficient number, since it is larger than the sum of its proper divisors (1).

1100110011109 is an equidigital number, since it uses as much as digits as its factorization.

1100110011109 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 9, while the sum is 16.

The spelling of 1100110011109 in words is "one trillion, one hundred billion, one hundred ten million, eleven thousand, one hundred nine".