Base | Representation |
---|---|
bin | 1101011010000… |
… | …00000100000000 |
3 | 21211121120011101 |
4 | 12231000010000 |
5 | 212242210112 |
6 | 15054224144 |
7 | 2533615546 |
oct | 655000400 |
9 | 254546141 |
10 | 112460032 |
11 | 58531983 |
12 | 317b5054 |
13 | 1a3b6cc9 |
14 | 10d15d96 |
15 | 9d16757 |
hex | 6b40100 |
112460032 has 36 divisors (see below), whose sum is σ = 237694716. Its totient is φ = 52920320.
The previous prime is 112460017. The next prime is 112460039. The reversal of 112460032 is 230064211.
It can be written as a sum of positive squares in 2 ways, for example, as 59228416 + 53231616 = 7696^2 + 7296^2 .
It is a super-3 number, since 3×1124600323 (a number of 25 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112459991 and 112460009.
It is not an unprimeable number, because it can be changed into a prime (112460039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8569 + ... + 17272.
It is an arithmetic number, because the mean of its divisors is an integer number (6602631).
Almost surely, 2112460032 is an apocalyptic number.
It is an amenable number.
112460032 is an abundant number, since it is smaller than the sum of its proper divisors (125234684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112460032 is an equidigital number, since it uses as much as digits as its factorization.
112460032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25874 (or 25860 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 112460032 is about 10604.7174408374. The cubic root of 112460032 is about 482.6875171170.
The spelling of 112460032 in words is "one hundred twelve million, four hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •