10111101102 has 64 divisors (see below), whose sum is σ = 23044633920. Its totient is φ = 3284236800.

The previous prime is 10111101089. The next prime is 10111101131. The reversal of 10111101102 is 20110111101.

10111101102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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 31 ways as a sum of consecutive naturals, for example, 2284852 + ... + 2289272.

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

Almost surely, 2^10111101102 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 10111101102 its reverse (20110111101), we get a palindrome (30221212203).

Subtracting 10111101102 from its reverse (20110111101), we obtain a palindrome (9999009999).

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