110100110011011 has 6 divisors (see below), whose sum is σ = 159033492238140. Its totient is φ = 73400073340668.

The previous prime is 110100110010997. The next prime is 110100110011027. The reversal of 110100110011011 is 110110011001011.

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

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12233345556779 = 110100110011011 / (1 + 1 + 0 + 1 + 0 + 0 + 1 + 1 + 0 + 0 + 1 + 1 + 0 + 1 + 1).

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6116672778381 + ... + 6116672778398.

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

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

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

110100110011011 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 12233345556785 (or 12233345556782 counting only the distinct ones).

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

Adding to 110100110011011 its reverse (110110011001011), we get a palindrome (220210121012022).

It can be divided in two parts, 1101001 and 10011011, that multiplied together give a palindrome (11022133122011).

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