110110110111211 has 8 divisors (see below), whose sum is σ = 125864708833280. Its totient is φ = 94361657137128.

The previous prime is 110110110111187. The next prime is 110110110111289. The reversal of 110110110111211 is 112111011011011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 110110110111211 - 2⁷ = 110110110111083 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (110110110141211) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1536398601 + ... + 1536470266.

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

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

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

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

110110110111211 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3072873993.

The product of its (nonzero) digits is 2, while the sum is 13.

Adding to 110110110111211 its reverse (112111011011011), we get a palindrome (222221121122222).

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