Base | Representation |
---|---|
bin | 1101010111000… |
… | …00010010000000 |
3 | 21210212122000000 |
4 | 12223200102000 |
5 | 212142131322 |
6 | 15042000000 |
7 | 2530363011 |
oct | 653402200 |
9 | 253778000 |
10 | 112067712 |
11 | 58294149 |
12 | 31646000 |
13 | 1a2aa573 |
14 | 10c53008 |
15 | 9c8a3ac |
hex | 6ae0480 |
112067712 has 112 divisors (see below), whose sum is σ = 335015430. Its totient is φ = 37324800.
The previous prime is 112067701. The next prime is 112067713. The reversal of 112067712 is 217760211.
It can be written as a sum of positive squares in only one way, i.e., 112021056 + 46656 = 10584^2 + 216^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (112067713) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 92712 + ... + 93912.
Almost surely, 2112067712 is an apocalyptic number.
112067712 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 112067712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167507715).
112067712 is an abundant number, since it is smaller than the sum of its proper divisors (222947718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112067712 is an frugal number, since it uses more digits than its factorization.
112067712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1233 (or 1206 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
The square root of 112067712 is about 10586.2038521842. The cubic root of 112067712 is about 482.1255734757.
The spelling of 112067712 in words is "one hundred twelve million, sixty-seven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •