Base | Representation |
---|---|
bin | 1101011000001… |
… | …01101101000000 |
3 | 21211011102021001 |
4 | 12230011231000 |
5 | 212212032432 |
6 | 15045141344 |
7 | 2531601622 |
oct | 654055500 |
9 | 254142231 |
10 | 112220992 |
11 | 58389324 |
12 | 316ba854 |
13 | 1a332270 |
14 | 10c92c12 |
15 | 9cba9e7 |
hex | 6b05b40 |
112220992 has 112 divisors (see below), whose sum is σ = 261721600. Its totient is φ = 47278080.
The previous prime is 112220921. The next prime is 112221017. The reversal of 112220992 is 299022211.
It is a self number, because there is not a number n which added to its sum of digits gives 112220992.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 489934 + ... + 490162.
It is an arithmetic number, because the mean of its divisors is an integer number (2336800).
Almost surely, 2112220992 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 112220992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130860800).
112220992 is an abundant number, since it is smaller than the sum of its proper divisors (149500608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112220992 is a wasteful number, since it uses less digits than its factorization.
112220992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304 (or 294 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 112220992 is about 10593.4409895935. The cubic root of 112220992 is about 482.3452815431.
The spelling of 112220992 in words is "one hundred twelve million, two hundred twenty thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •