Search a number
-
+
110913682000 = 24531122319927
BaseRepresentation
bin110011101001011111…
…0000111101001010000
3101121021202122211110011
41213102332013221100
53304122400311000
6122541505044304
711004354512242
oct1472276075120
9347252584404
10110913682000
1143046977a00
12195b4926694
13a5c78a4044
1455226a2092
152d424282ba
hex19d2f87a50

110913682000 has 240 divisors, whose sum is σ = 307618811136. Its totient is φ = 38576736000.

The previous prime is 110913681947. The next prime is 110913682007. The reversal of 110913682000 is 286319011.

It is a congruent number.

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

Almost surely, 2110913682000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 31.

The spelling of 110913682000 in words is "one hundred ten billion, nine hundred thirteen million, six hundred eighty-two thousand".