11010111011001 has 6 divisors (see below), whose sum is σ = 15903493682570. Its totient is φ = 7340074007328.

The previous prime is 11010111010961. The next prime is 11010111011017. The reversal of 11010111011001 is 10011011101011.

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

It can be written as a sum of positive squares in only one way, i.e., 9831366521001 + 1178744490000 = 3135501^2 + 1085700^2 .

It is not a de Polignac number, because 11010111011001 - 2⁹ = 11010111010489 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1223345667889 = 11010111011001 / (1 + 1 + 0 + 1 + 0 + 1 + 1 + 1 + 0 + 1 + 1 + 0 + 0 + 1).

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (11010111011101) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 611672833936 + ... + 611672833953.

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

It is an amenable number.

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

11010111011001 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1223345667895 (or 1223345667892 counting only the distinct ones).

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

Adding to 11010111011001 its reverse (10011011101011), we get a palindrome (21021122112012).

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