110110001010111 has 6 divisors (see below), whose sum is σ = 159047779236840. Its totient is φ = 73406667340068.

The previous prime is 110110001010109. The next prime is 110110001010131. The reversal of 110110001010111 is 111010100011011.

It is not a de Polignac number, because 110110001010111 - 2¹ = 110110001010109 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: 12234444556679 = 110110001010111 / (1 + 1 + 0 + 1 + 1 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 1 + 1 + 1).

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

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

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

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

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

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

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

Adding to 110110001010111 its reverse (111010100011011), we get a palindrome (221120101021122).

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