Base | Representation |
---|---|
bin | 1101011001001… |
… | …00101110110000 |
3 | 21211101212121000 |
4 | 12230210232300 |
5 | 212230114310 |
6 | 15052002000 |
7 | 2532641265 |
oct | 654445660 |
9 | 254355530 |
10 | 112348080 |
11 | 58465859 |
12 | 31760300 |
13 | 1a378070 |
14 | 10cc726c |
15 | 9ce34c0 |
hex | 6b24bb0 |
112348080 has 160 divisors (see below), whose sum is σ = 416848320. Its totient is φ = 27648000.
The previous prime is 112348039. The next prime is 112348091. The reversal of 112348080 is 80843211.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 31 ways as a sum of consecutive naturals, for example, 26080 + ... + 30080.
It is an arithmetic number, because the mean of its divisors is an integer number (2605302).
Almost surely, 2112348080 is an apocalyptic number.
112348080 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 112348080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208424160).
112348080 is an abundant number, since it is smaller than the sum of its proper divisors (304500240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112348080 is a wasteful number, since it uses less digits than its factorization.
112348080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4036 (or 4024 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 112348080 is about 10599.4377209360. The cubic root of 112348080 is about 482.5272949381.
The spelling of 112348080 in words is "one hundred twelve million, three hundred forty-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •