1001101010009 has 2 divisors, whose sum is σ = 1001101010010. Its totient is φ = 1001101010008.

The previous prime is 1001101009981. The next prime is 1001101010023. The reversal of 1001101010009 is 9000101011001.

It is a happy number.

It is an a-pointer prime, because the next prime (1001101010023) can be obtained adding 1001101010009 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 656743297609 + 344357712400 = 810397^2 + 586820^2 .

It is an emirp because it is prime and its reverse (9000101011001) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1001101010009 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is not a weakly prime, because it can be changed into another prime (1001101010069) 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 as a sum of consecutive naturals, namely, 500550505004 + 500550505005.

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

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

It is an amenable number.

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

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

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

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

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