10111109502 has 64 divisors (see below), whose sum is σ = 23099408640. Its totient is φ = 2924812800.

The previous prime is 10111109501. The next prime is 10111109539. The reversal of 10111109502 is 20590111101.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^10111109502 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 52249.

The product of its (nonzero) digits is 90, while the sum is 21.

The spelling of 10111109502 in words is "ten billion, one hundred eleven million, one hundred nine thousand, five hundred two".