110011011010001 has 2 divisors, whose sum is σ = 110011011010002. Its totient is φ = 110011011010000.

The previous prime is 110011011009989. The next prime is 110011011010009. The reversal of 110011011010001 is 100010110110011.

It is an a-pointer prime, because the next prime (110011011010009) can be obtained adding 110011011010001 to its sum of digits (8).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69803351425600 + 40207659584401 = 8354840^2 + 6340951^2 .

It is a cyclic number.

It is not a de Polignac number, because 110011011010001 - 2⁴² = 105612964498897 is a prime.

It is a super-2 number, since 2×110011011010001² (a number of 29 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (110011011010009) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005505505000 + 55005505505001.

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

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

It is an amenable number.

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

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

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

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

Adding to 110011011010001 its reverse (100010110110011), we get a palindrome (210021121120012).

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