1101100101109 has 2 divisors, whose sum is σ = 1101100101110. Its totient is φ = 1101100101108.

The previous prime is 1101100101091. The next prime is 1101100101121. The reversal of 1101100101109 is 9011010011011.

Together with previous prime (1101100101091) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 758559128209 + 342540972900 = 870953^2 + 585270^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101100101109 - 2³¹ = 1098952617461 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

1101100101109 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 1101100101109 in words is "one trillion, one hundred one billion, one hundred million, one hundred one thousand, one hundred nine".