Base | Representation |
---|---|
bin | 1101011010101… |
… | …11010001001000 |
3 | 21211210101112200 |
4 | 12231113101020 |
5 | 212303230310 |
6 | 15100240200 |
7 | 2534462631 |
oct | 655272110 |
9 | 254711480 |
10 | 112555080 |
11 | 58597330 |
12 | 31840060 |
13 | 1a41b351 |
14 | 10d3c888 |
15 | 9d349c0 |
hex | 6b57448 |
112555080 has 192 divisors, whose sum is σ = 408957120. Its totient is φ = 26611200.
The previous prime is 112555063. The next prime is 112555129. The reversal of 112555080 is 80555211.
112555080 is a `hidden beast` number, since 11 + 25 + 550 + 80 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 169950 + ... + 170610.
It is an arithmetic number, because the mean of its divisors is an integer number (2129985).
Almost surely, 2112555080 is an apocalyptic number.
112555080 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 112555080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204478560).
112555080 is an abundant number, since it is smaller than the sum of its proper divisors (296402040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112555080 is a wasteful number, since it uses less digits than its factorization.
112555080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732 (or 725 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The square root of 112555080 is about 10609.1978961654. The cubic root of 112555080 is about 482.8234633826.
The spelling of 112555080 in words is "one hundred twelve million, five hundred fifty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •