Base | Representation |
---|---|
bin | 1101010111101… |
… | …11101101111010 |
3 | 21211001111200100 |
4 | 12223313231322 |
5 | 212203214311 |
6 | 15044020230 |
7 | 2531242614 |
oct | 653675572 |
9 | 254044610 |
10 | 112163706 |
11 | 5834a286 |
12 | 31691676 |
13 | 1a312175 |
14 | 10c79db4 |
15 | 9ca8a56 |
hex | 6af7b7a |
112163706 has 48 divisors (see below), whose sum is σ = 253244160. Its totient is φ = 35834400.
The previous prime is 112163699. The next prime is 112163729. The reversal of 112163706 is 607361211.
112163706 is a `hidden beast` number, since 1 + 1 + 21 + 637 + 0 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 112163706.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 78111 + ... + 79533.
It is an arithmetic number, because the mean of its divisors is an integer number (5275920).
Almost surely, 2112163706 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112163706, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126622080).
112163706 is an abundant number, since it is smaller than the sum of its proper divisors (141080454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112163706 is a wasteful number, since it uses less digits than its factorization.
112163706 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1611 (or 1608 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 112163706 is about 10590.7368015639. The cubic root of 112163706 is about 482.2631925198.
The spelling of 112163706 in words is "one hundred twelve million, one hundred sixty-three thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •