111520112 has 40 divisors (see below), whose sum is σ = 236651520. Its totient is φ = 50489280.

The previous prime is 111520111. The next prime is 111520121. The reversal of 111520112 is 211025111.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48689 + ... + 50927.

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

Almost surely, 2^111520112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 20, while the sum is 14.

The square root of 111520112 is about 10560.3083288321. The cubic root of 111520112 is about 481.3390158159.

Adding to 111520112 its reverse (211025111), we get a palindrome (322545223).

The spelling of 111520112 in words is "one hundred eleven million, five hundred twenty thousand, one hundred twelve".