11001000021111 has 6 divisors (see below), whose sum is σ = 15890333363840. Its totient is φ = 7334000014068.

The previous prime is 11001000021103. The next prime is 11001000021133. The reversal of 11001000021111 is 11112000010011.

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

It is not a de Polignac number, because 11001000021111 - 2³ = 11001000021103 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: 1222333335679 = 11001000021111 / (1 + 1 + 0 + 0 + 1 + 0 + 0 + 0 + 0 + 2 + 1 + 1 + 1 + 1).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001000021911) 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, 611166667831 + ... + 611166667848.

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

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

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

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

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

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

Adding to 11001000021111 its reverse (11112000010011), we get a palindrome (22113000031122).

The spelling of 11001000021111 in words is "eleven trillion, one billion, twenty-one thousand, one hundred eleven".