Search a number
-
+
112001131110 = 235111773491557
BaseRepresentation
bin110100001001111001…
…0011010001001100110
3101201002112212222012010
41220103302122021212
53313334242143420
6123241432535050
711043330622641
oct1502362321146
9351075788163
10112001131110
114355479a580
1219858b51486
13a73bc7c05b
1455c6c94a58
152da7b304e0
hex1a13c9a266

112001131110 has 256 divisors, whose sum is σ = 315949206528. Its totient is φ = 25108070400.

The previous prime is 112001131069. The next prime is 112001131141. The reversal of 112001131110 is 11131100211.

It is a Curzon number.

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 127 ways as a sum of consecutive naturals, for example, 201078952 + ... + 201079508.

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

Almost surely, 2112001131110 is an apocalyptic number.

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

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

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

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

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

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

The sum of its prime factors is 1159.

The product of its (nonzero) digits is 6, while the sum is 12.

Adding to 112001131110 its reverse (11131100211), we get a palindrome (123132231321).

The spelling of 112001131110 in words is "one hundred twelve billion, one million, one hundred thirty-one thousand, one hundred ten".