11001011101009 has 4 divisors (see below), whose sum is σ = 11355882426880. Its totient is φ = 10646139775140.

The previous prime is 11001011100949. The next prime is 11001011101021. The reversal of 11001011101009 is 90010111010011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11001011101009 - 2⁷ = 11001011100881 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (11001011101079) 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 in 3 ways as a sum of consecutive naturals, for example, 177435662889 + ... + 177435662950.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 354871325870.

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

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