Base | Representation |
---|---|
bin | 1101010111001… |
… | …10001110000000 |
3 | 21210220212100202 |
4 | 12223212032000 |
5 | 212143421112 |
6 | 15042304332 |
7 | 2530523633 |
oct | 653461600 |
9 | 253825322 |
10 | 112092032 |
11 | 58300448 |
12 | 316580a8 |
13 | 1a2b8660 |
14 | 10c5bc1a |
15 | 9c926c2 |
hex | 6ae6380 |
112092032 has 128 divisors (see below), whose sum is σ = 259096320. Its totient is φ = 47923200.
The previous prime is 112092017. The next prime is 112092037. The reversal of 112092032 is 230290211.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 112091995 and 112092013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112092037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2114918 + ... + 2114970.
It is an arithmetic number, because the mean of its divisors is an integer number (2024190).
Almost surely, 2112092032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112092032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129548160).
112092032 is an abundant number, since it is smaller than the sum of its proper divisors (147004288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112092032 is a wasteful number, since it uses less digits than its factorization.
112092032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 112092032 is about 10587.3524546980. The cubic root of 112092032 is about 482.1604465765.
The spelling of 112092032 in words is "one hundred twelve million, ninety-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •