110101000111011 has 144 divisors (see below), whose sum is σ = 207205080700800. Its totient is φ = 55790381477376.

The previous prime is 110101000110977. The next prime is 110101000111057. The reversal of 110101000111011 is 110111000101011.

It is not a de Polignac number, because 110101000111011 - 2⁹ = 110101000110499 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is not an unprimeable number, because it can be changed into a prime (110101000111061) 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 in 143 ways as a sum of consecutive naturals, for example, 13472445 + ... + 20042673.

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

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

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

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

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

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

Adding to 110101000111011 its reverse (110111000101011), we get a palindrome (220212000212022).

It can be divided in two parts, 110101000 and 111011, that added together give a palindrome (110212011).

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