110001010001009 has 2 divisors, whose sum is σ = 110001010001010. Its totient is φ = 110001010001008.

The previous prime is 110001010000993. The next prime is 110001010001011. The reversal of 110001010001009 is 900100010100011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88461172944400 + 21539837056609 = 9405380^2 + 4641103^2 .

It is a cyclic number.

It is not a de Polignac number, because 110001010001009 - 2⁴ = 110001010000993 is a prime.

It is a Sophie Germain prime.

Together with 110001010001011, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

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

It is an amenable number.

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

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

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

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

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