10141201120 has 96 divisors (see below), whose sum is σ = 25010415360. Its totient is φ = 3881349120.

The previous prime is 10141201117. The next prime is 10141201127. The reversal of 10141201120 is 2110214101.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10141201120.

It is a congruent number.

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

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

Almost surely, 2^10141201120 is an apocalyptic number.

10141201120 is a gapful number since it is divisible by the number (10) 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 10141201120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12505207680).

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

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

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

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

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

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 10141201120 its reverse (2110214101), we get a palindrome (12251415221).

The spelling of 10141201120 in words is "ten billion, one hundred forty-one million, two hundred one thousand, one hundred twenty".