Base | Representation |
---|---|
bin | 11001011111011101100100… |
… | …000111111100100110011001 |
3 | 112200221220210110010000212122 |
4 | 121133131210013330212121 |
5 | 104143330324022213223 |
6 | 1034240033112151025 |
7 | 32420624613002066 |
oct | 3137354407744631 |
9 | 480856713100778 |
10 | 112113211132313 |
11 | 327a4a44998346 |
12 | 106a835b698475 |
13 | 4a732cc39b301 |
14 | 1d98446259c6d |
15 | ce64c66845c8 |
hex | 65f7641fc999 |
112113211132313 has 12 divisors (see below), whose sum is σ = 119100025390080. Its totient is φ = 105514786120512.
The previous prime is 112113211132291. The next prime is 112113211132331. The reversal of 112113211132313 is 313231112311211.
It is not a de Polignac number, because 112113211132313 - 222 = 112113206938009 is a prime.
It is a super-2 number, since 2×1121132111323132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112113211134313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2183720 + ... + 15132582.
It is an arithmetic number, because the mean of its divisors is an integer number (9925002115840).
Almost surely, 2112113211132313 is an apocalyptic number.
It is an amenable number.
112113211132313 is a deficient number, since it is larger than the sum of its proper divisors (6986814257767).
112113211132313 is a wasteful number, since it uses less digits than its factorization.
112113211132313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12978856 (or 12978839 counting only the distinct ones).
The product of its digits is 648, while the sum is 26.
Adding to 112113211132313 its reverse (313231112311211), we get a palindrome (425344323443524).
The spelling of 112113211132313 in words is "one hundred twelve trillion, one hundred thirteen billion, two hundred eleven million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •