Base | Representation |
---|---|
bin | 1101011001110… |
… | …01010110001000 |
3 | 21211120011102102 |
4 | 12230321112020 |
5 | 212240320040 |
6 | 15053452532 |
7 | 2533442414 |
oct | 654712610 |
9 | 254504372 |
10 | 112432520 |
11 | 58513242 |
12 | 317a1148 |
13 | 1a3a7625 |
14 | 10d09d44 |
15 | 9d0d515 |
hex | 6b39588 |
112432520 has 32 divisors (see below), whose sum is σ = 253312920. Its totient is φ = 44912640.
The previous prime is 112432471. The next prime is 112432549. The reversal of 112432520 is 25234211.
It can be written as a sum of positive squares in 4 ways, for example, as 109453444 + 2979076 = 10462^2 + 1726^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 112432492 and 112432501.
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, 39464 + ... + 42216.
Almost surely, 2112432520 is an apocalyptic number.
112432520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112432520 is an abundant number, since it is smaller than the sum of its proper divisors (140880400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112432520 is a wasteful number, since it uses less digits than its factorization.
112432520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3785 (or 3781 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 112432520 is about 10603.4202029345. The cubic root of 112432520 is about 482.6481526667.
Adding to 112432520 its reverse (25234211), we get a palindrome (137666731).
The spelling of 112432520 in words is "one hundred twelve million, four hundred thirty-two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •