Base | Representation |
---|---|
bin | 1101010111001… |
… | …11011000110100 |
3 | 21210221002221002 |
4 | 12223213120310 |
5 | 212144044240 |
6 | 15042342432 |
7 | 2530543613 |
oct | 653473064 |
9 | 253832832 |
10 | 112096820 |
11 | 58304000 |
12 | 3165aa18 |
13 | 1a2ba8a4 |
14 | 10c5d87a |
15 | 9c93d15 |
hex | 6ae7634 |
112096820 has 48 divisors (see below), whose sum is σ = 258987456. Its totient is φ = 40752800.
The previous prime is 112096811. The next prime is 112096867. The reversal of 112096820 is 28690211.
112096820 = 2692 + 2702 + ... + 7082.
It is a super-2 number, since 2×1120968202 = 25131394108224800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24515 + ... + 28725.
It is an arithmetic number, because the mean of its divisors is an integer number (5395572).
Almost surely, 2112096820 is an apocalyptic number.
112096820 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 112096820, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129493728).
112096820 is an abundant number, since it is smaller than the sum of its proper divisors (146890636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112096820 is a wasteful number, since it uses less digits than its factorization.
112096820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4253 (or 4229 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 29.
The square root of 112096820 is about 10587.5785711370. The cubic root of 112096820 is about 482.1673116240.
The spelling of 112096820 in words is "one hundred twelve million, ninety-six thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •