Base | Representation |
---|---|
bin | 1101011100000… |
… | …00001011011000 |
3 | 21212002220101220 |
4 | 12232000023120 |
5 | 212324111043 |
6 | 15104012040 |
7 | 2536061313 |
oct | 656001330 |
9 | 255086356 |
10 | 112722648 |
11 | 586a1215 |
12 | 31901020 |
13 | 1a4796bc |
14 | 10d8397a |
15 | 9d69483 |
hex | 6b802d8 |
112722648 has 64 divisors (see below), whose sum is σ = 300296160. Its totient is φ = 35137536.
The previous prime is 112722647. The next prime is 112722691. The reversal of 112722648 is 846227211.
Its product of digits (10752) is a multiple of the sum of its prime divisors (1792).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112722647) by changing a digit.
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, 69786 + ... + 71382.
Almost surely, 2112722648 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 112722648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150148080).
112722648 is an abundant number, since it is smaller than the sum of its proper divisors (187573512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112722648 is a wasteful number, since it uses less digits than its factorization.
112722648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1796 (or 1792 counting only the distinct ones).
The product of its digits is 10752, while the sum is 33.
The square root of 112722648 is about 10617.0922572991. The cubic root of 112722648 is about 483.0629480432.
Adding to 112722648 its reverse (846227211), we get a palindrome (958949859).
The spelling of 112722648 in words is "one hundred twelve million, seven hundred twenty-two thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •