11010011009 has 2 divisors, whose sum is σ = 11010011010. Its totient is φ = 11010011008.

The previous prime is 11010010969. The next prime is 11010011027. The reversal of 11010011009 is 90011001011.

It is a happy number.

11010011009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7305462784 + 3704548225 = 85472^2 + 60865^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (11010011039) 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, 5505005504 + 5505005505.

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

Almost surely, 2^11010011009 is an apocalyptic number.

It is an amenable number.

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

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

11010011009 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 11010011009 in words is "eleven billion, ten million, eleven thousand, nine".