Search a number
-
+
111664906080 = 253571319157857
BaseRepresentation
bin110011111111110111…
…1110011111101100000
3101200020010012222011020
41213333233303331200
53312142203443310
6123144222245440
711032106020020
oct1477757637540
9350203188136
10111664906080
11433a1a23752
1219784426880
13a6b7409a30
145594371a80
152d88368170
hex19ffbf3f60

111664906080 has 768 divisors, whose sum is σ = 459139000320. Its totient is φ = 22152019968.

The previous prime is 111664906057. The next prime is 111664906117. The reversal of 111664906080 is 80609466111.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 130297012 + ... + 130297868.

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

Almost surely, 2111664906080 is an apocalyptic number.

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

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

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

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

111664906080 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 62208, while the sum is 42.

The spelling of 111664906080 in words is "one hundred eleven billion, six hundred sixty-four million, nine hundred six thousand, eighty".