11011011010009 has 2 divisors, whose sum is σ = 11011011010010. Its totient is φ = 11011011010008.

The previous prime is 11011011010007. The next prime is 11011011010049. The reversal of 11011011010009 is 90001011011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10691330457600 + 319680552409 = 3269760^2 + 565403^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011011010009 - 2¹ = 11011011010007 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

11011011010009 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 16.

The spelling of 11011011010009 in words is "eleven trillion, eleven billion, eleven million, ten thousand, nine".