Base | Representation |
---|---|
bin | 1101010111100… |
… | …01010111000000 |
3 | 21211000011221211 |
4 | 12223301113000 |
5 | 212201401124 |
6 | 15043255504 |
7 | 2531103652 |
oct | 653612700 |
9 | 254004854 |
10 | 112137664 |
11 | 58331761 |
12 | 3167a594 |
13 | 1a303362 |
14 | 10c706d2 |
15 | 9ca0e94 |
hex | 6af15c0 |
112137664 has 56 divisors (see below), whose sum is σ = 237744000. Its totient is φ = 52362240.
The previous prime is 112137659. The next prime is 112137667. The reversal of 112137664 is 466731211.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112137667) 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 7 ways as a sum of consecutive naturals, for example, 56562 + ... + 58510.
Almost surely, 2112137664 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 112137664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118872000).
112137664 is an abundant number, since it is smaller than the sum of its proper divisors (125606336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112137664 is a wasteful number, since it uses less digits than its factorization.
112137664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2021 (or 2011 counting only the distinct ones).
The product of its digits is 6048, while the sum is 31.
The square root of 112137664 is about 10589.5072595471. The cubic root of 112137664 is about 482.2258659174.
Adding to 112137664 its reverse (466731211), we get a palindrome (578868875).
The spelling of 112137664 in words is "one hundred twelve million, one hundred thirty-seven thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •