1101111091 has 2 divisors, whose sum is σ = 1101111092. Its totient is φ = 1101111090.

The previous prime is 1101111073. The next prime is 1101111107. The reversal of 1101111091 is 1901111011.

It is an a-pointer prime, because the next prime (1101111107) can be obtained adding 1101111091 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1101111091 - 2⁷ = 1101110963 is a prime.

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

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

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

Almost surely, 2^1101111091 is an apocalyptic number.

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

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

1101111091 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 square root of 1101111091 is about 33182.9940029528. The cubic root of 1101111091 is about 1032.6275612711.

The spelling of 1101111091 in words is "one billion, one hundred one million, one hundred eleven thousand, ninety-one".