11121332022 has 64 divisors (see below), whose sum is σ = 25236711360. Its totient is φ = 3629463552.

The previous prime is 11121331999. The next prime is 11121332023. The reversal of 11121332022 is 22023312111.

11121332022 is a `hidden beast` number, since 111 + 213 + 320 + 22 = 666.

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

It is a Harshad number since it is a multiple of its sum of digits (18).

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 529758 + ... + 550350.

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

Almost surely, 2^11121332022 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11121332022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12618355680).

11121332022 is an abundant number, since it is smaller than the sum of its proper divisors (14115379338).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 18.

Adding to 11121332022 its reverse (22023312111), we get a palindrome (33144644133).

The spelling of 11121332022 in words is "eleven billion, one hundred twenty-one million, three hundred thirty-two thousand, twenty-two".