10111109970 has 32 divisors (see below), whose sum is σ = 26133331392. Its totient is φ = 2488888512.

The previous prime is 10111109969. The next prime is 10111109989. The reversal of 10111109970 is 7990111101.

10111109970 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 (30).

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 12962572 + ... + 12963351.

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

Almost surely, 2^10111109970 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 25925946.

The product of its (nonzero) digits is 567, while the sum is 30.

The spelling of 10111109970 in words is "ten billion, one hundred eleven million, one hundred nine thousand, nine hundred seventy".