Base | Representation |
---|---|
bin | 1101001110000… |
… | …00110001100000 |
3 | 21201122210121000 |
4 | 12213000301200 |
5 | 211341440310 |
6 | 15000432000 |
7 | 2514356460 |
oct | 647006140 |
9 | 251583530 |
10 | 110890080 |
11 | 5765a3a4 |
12 | 31178600 |
13 | 19c87542 |
14 | 10a27ba0 |
15 | 9b064c0 |
hex | 69c0c60 |
110890080 has 384 divisors, whose sum is σ = 469324800. Its totient is φ = 23887872.
The previous prime is 110890067. The next prime is 110890081. The reversal of 110890080 is 80098011.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110890081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 574464 + ... + 574656.
It is an arithmetic number, because the mean of its divisors is an integer number (1222200).
Almost surely, 2110890080 is an apocalyptic number.
110890080 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 110890080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234662400).
110890080 is an abundant number, since it is smaller than the sum of its proper divisors (358434720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110890080 is a wasteful number, since it uses less digits than its factorization.
110890080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The square root of 110890080 is about 10530.4358884141. The cubic root of 110890080 is about 480.4308631280.
The spelling of 110890080 in words is "one hundred ten million, eight hundred ninety thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •