101015117112 has 128 divisors (see below), whose sum is σ = 310911068160. Its totient is φ = 26633180160.

The previous prime is 101015117107. The next prime is 101015117113. The reversal of 101015117112 is 211711510101.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101015117113) 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, 11092353 + ... + 11101455.

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

Almost surely, 2^101015117112 is an apocalyptic number.

101015117112 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 101015117112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155455534080).

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

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

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

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

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

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

Adding to 101015117112 its reverse (211711510101), we get a palindrome (312726627213).

The spelling of 101015117112 in words is "one hundred one billion, fifteen million, one hundred seventeen thousand, one hundred twelve".