Base | Representation |
---|---|
bin | 1101011000001… |
… | …11110011100000 |
3 | 21211011212001212 |
4 | 12230013303200 |
5 | 212212321400 |
6 | 15045245252 |
7 | 2531636000 |
oct | 654076340 |
9 | 254155055 |
10 | 112229600 |
11 | 5839483a |
12 | 31703828 |
13 | 1a336162 |
14 | 10c96000 |
15 | 9cbd335 |
hex | 6b07ce0 |
112229600 has 144 divisors (see below), whose sum is σ = 320292000. Its totient is φ = 38384640.
The previous prime is 112229549. The next prime is 112229633. The reversal of 112229600 is 6922211.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 274196 + ... + 274604.
It is an arithmetic number, because the mean of its divisors is an integer number (2224250).
Almost surely, 2112229600 is an apocalyptic number.
112229600 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 112229600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160146000).
112229600 is an abundant number, since it is smaller than the sum of its proper divisors (208062400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112229600 is an equidigital number, since it uses as much as digits as its factorization.
112229600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450 (or 423 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 112229600 is about 10593.8472709399. The cubic root of 112229600 is about 482.3576141200.
The spelling of 112229600 in words is "one hundred twelve million, two hundred twenty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •