Base | Representation |
---|---|
bin | 1101011001111… |
… | …00001011010000 |
3 | 21211120202022202 |
4 | 12230330023100 |
5 | 212241202422 |
6 | 15054022332 |
7 | 2533521254 |
oct | 654741320 |
9 | 254522282 |
10 | 112444112 |
11 | 58520a20 |
12 | 317a79a8 |
13 | 1a3ac9a1 |
14 | 10d10264 |
15 | 9d11b92 |
hex | 6b3c2d0 |
112444112 has 40 divisors (see below), whose sum is σ = 239529312. Its totient is φ = 50710400.
The previous prime is 112444091. The next prime is 112444127. The reversal of 112444112 is 211444211.
It is a nude number because it is divisible by every one of its digits.
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 7 ways as a sum of consecutive naturals, for example, 20618 + ... + 25494.
Almost surely, 2112444112 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 112444112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119764656).
112444112 is an abundant number, since it is smaller than the sum of its proper divisors (127085200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112444112 is a wasteful number, since it uses less digits than its factorization.
112444112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5027 (or 5021 counting only the distinct ones).
The product of its digits is 256, while the sum is 20.
The square root of 112444112 is about 10603.9668049273. The cubic root of 112444112 is about 482.6647394013.
Adding to 112444112 its reverse (211444211), we get a palindrome (323888323).
Subtracting 112444112 from its reverse (211444211), we obtain a palindrome (99000099).
The spelling of 112444112 in words is "one hundred twelve million, four hundred forty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •