110111001011001 has 12 divisors (see below), whose sum is σ = 160593390904128. Its totient is φ = 72694641443544.

The previous prime is 110111001010979. The next prime is 110111001011009. The reversal of 110111001011001 is 100110100111011.

It is not a de Polignac number, because 110111001011001 - 2⁷ = 110111001010873 is a prime.

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

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59391046005 + ... + 59391047858.

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

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

It is an amenable number.

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

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

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

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

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

Adding to 110111001011001 its reverse (100110100111011), we get a palindrome (210221101122012).

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