Base | Representation |
---|---|
bin | 1101011100111… |
… | …10001000000000 |
3 | 21212100010200000 |
4 | 12232132020000 |
5 | 212342022222 |
6 | 15110400000 |
7 | 2540112036 |
oct | 656361000 |
9 | 255303600 |
10 | 112845312 |
11 | 58775398 |
12 | 31960000 |
13 | 1a4c0498 |
14 | 10db6556 |
15 | 9d909ac |
hex | 6b9e200 |
112845312 has 120 divisors (see below), whose sum is σ = 338113776. Its totient is φ = 37573632.
The previous prime is 112845307. The next prime is 112845349. The reversal of 112845312 is 213548211.
112845312 is a `hidden beast` number, since 1 + 128 + 4 + 531 + 2 = 666.
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 (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 123963 + ... + 124869.
Almost surely, 2112845312 is an apocalyptic number.
112845312 is a gapful number since it is divisible by the number (12) 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 112845312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169056888).
112845312 is an abundant number, since it is smaller than the sum of its proper divisors (225268464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112845312 is an frugal number, since it uses more digits than its factorization.
112845312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940 (or 912 counting only the distinct ones).
The product of its digits is 1920, while the sum is 27.
The square root of 112845312 is about 10622.8674095086. The cubic root of 112845312 is about 483.2381064344.
The spelling of 112845312 in words is "one hundred twelve million, eight hundred forty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •