111068389152 has 576 divisors, whose sum is σ = 398008525824. Its totient is φ = 28658073600.

The previous prime is 111068389151. The next prime is 111068389171. The reversal of 111068389152 is 251983860111.

111068389152 is a `hidden beast` number, since 1 + 110 + 6 + 8 + 389 + 152 = 666.

It is a super-2 number, since 2×111068389152² (a number of 23 digits) contains 22 as substring.

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

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

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

Almost surely, 2^111068389152 is an apocalyptic number.

111068389152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 45.

The spelling of 111068389152 in words is "one hundred eleven billion, sixty-eight million, three hundred eighty-nine thousand, one hundred fifty-two".