Base | Representation |
---|---|
bin | 1101010110110… |
… | …10100110010000 |
3 | 21210211110001210 |
4 | 12223122212100 |
5 | 212140410212 |
6 | 15041300120 |
7 | 2530235103 |
oct | 653324620 |
9 | 253743053 |
10 | 112044432 |
11 | 58278705 |
12 | 31634640 |
13 | 1a29caa6 |
14 | 10c4873a |
15 | 9c8353c |
hex | 6ada990 |
112044432 has 20 divisors (see below), whose sum is σ = 289448240. Its totient is φ = 37348128.
The previous prime is 112044419. The next prime is 112044437. The reversal of 112044432 is 234440211.
It is a junction number, because it is equal to n+sod(n) for n = 112044399 and 112044408.
It is not an unprimeable number, because it can be changed into a prime (112044437) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1167082 + ... + 1167177.
It is an arithmetic number, because the mean of its divisors is an integer number (14472412).
Almost surely, 2112044432 is an apocalyptic number.
112044432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112044432 is an abundant number, since it is smaller than the sum of its proper divisors (177403808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112044432 is a wasteful number, since it uses less digits than its factorization.
112044432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334270 (or 2334264 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 112044432 is about 10585.1042507856. The cubic root of 112044432 is about 482.0921869322.
Adding to 112044432 its reverse (234440211), we get a palindrome (346484643).
The spelling of 112044432 in words is "one hundred twelve million, forty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •