Base | Representation |
---|---|
bin | 110100010011001100… |
… | …0101110100100011001 |
3 | 101201220022000222201210 |
4 | 1220212120232210121 |
5 | 3320004132303410 |
6 | 123332420533333 |
7 | 11054140105650 |
oct | 1504630564431 |
9 | 351808028653 |
10 | 112313166105 |
11 | 436a4944038 |
12 | 19925551249 |
13 | a78b801a4a |
14 | 56164bc197 |
15 | 2dc521a220 |
hex | 1a2662e919 |
112313166105 has 64 divisors (see below), whose sum is σ = 214696194048. Its totient is φ = 49020491520.
The previous prime is 112313166101. The next prime is 112313166107. The reversal of 112313166105 is 501661313211.
It is not a de Polignac number, because 112313166105 - 22 = 112313166101 is a prime.
It is a super-2 number, since 2×1123131661052 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112313166101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1278495 + ... + 1363515.
It is an arithmetic number, because the mean of its divisors is an integer number (3354628032).
Almost surely, 2112313166105 is an apocalyptic number.
112313166105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
112313166105 is a deficient number, since it is larger than the sum of its proper divisors (102383027943).
112313166105 is a wasteful number, since it uses less digits than its factorization.
112313166105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85606.
The product of its (nonzero) digits is 3240, while the sum is 30.
Adding to 112313166105 its reverse (501661313211), we get a palindrome (613974479316).
The spelling of 112313166105 in words is "one hundred twelve billion, three hundred thirteen million, one hundred sixty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •