113216022 has 64 divisors (see below), whose sum is σ = 280454400. Its totient is φ = 33644160.

The previous prime is 113215987. The next prime is 113216027. The reversal of 113216022 is 220612311.

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 = 113215986 and 113216004.

It is a congruent number.

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

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

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

Almost surely, 2^113216022 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 113216022 is about 10640.3017814346. The cubic root of 113216022 is about 483.7666925314.

Adding to 113216022 its reverse (220612311), we get a palindrome (333828333).

The spelling of 113216022 in words is "one hundred thirteen million, two hundred sixteen thousand, twenty-two".