11011111020021 has 48 divisors (see below), whose sum is σ = 17668116446400. Its totient is φ = 6074839153152.

The previous prime is 11011111019959. The next prime is 11011111020037. The reversal of 11011111020021 is 12002011111011.

It is not a de Polignac number, because 11011111020021 - 2⁹ = 11011111019509 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11011111020121) 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 47 ways as a sum of consecutive naturals, for example, 148055181 + ... + 148129533.

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

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 12.

Adding to 11011111020021 its reverse (12002011111011), we get a palindrome (23013122131032).

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