Search a number
-
+
10111112100 = 223252173753337
BaseRepresentation
bin10010110101010101…
…10101001110100100
3222002122211201021100
421122222311032210
5131201421041400
64351152120100
7505364014635
oct113252651644
928078751240
1010111112100
1143195061a1
121b62236030
13c51a21a8b
146bcc0788c
153e2a0a100
hex25aab53a4

10111112100 has 432 divisors, whose sum is σ = 35218402128. Its totient is φ = 2415329280.

The previous prime is 10111112071. The next prime is 10111112129. The reversal of 10111112100 is 121111101.

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

It is an interprime number because it is at equal distance from previous prime (10111112071) and next prime (10111112129).

It can be written as a sum of positive squares in 24 ways, for example, as 2828537856 + 7282574244 = 53184^2 + 85338^2 .

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

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 143 ways as a sum of consecutive naturals, for example, 30003132 + ... + 30003468.

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

Almost surely, 210111112100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10111112100 its reverse (121111101), we get a palindrome (10232223201).

Subtracting from 10111112100 its reverse (121111101), we obtain a palindrome (9990000999).

It can be divided in two parts, 1011 and 1112100, that added together give a palindrome (1113111).

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