Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1111101011110100101 |
3 | 101201101100210020022022 |
4 | 1220122131331132211 |
5 | 3314101440230201 |
6 | 123300515112525 |
7 | 11046161400230 |
oct | 1503235753645 |
9 | 351340706268 |
10 | 112113211301 |
11 | 43601a92033 |
12 | 1988a5a2745 |
13 | a7592621b0 |
14 | 55d7b0c417 |
15 | 2db28be41b |
hex | 1a1a77d7a5 |
112113211301 has 8 divisors (see below), whose sum is σ = 137985490944. Its totient is φ = 88704958320.
The previous prime is 112113211297. The next prime is 112113211319. The reversal of 112113211301 is 103112311211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112113211301 - 22 = 112113211297 is a prime.
It is a super-2 number, since 2×1121132113012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112113211301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112113211601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 616006565 + ... + 616006746.
It is an arithmetic number, because the mean of its divisors is an integer number (17248186368).
Almost surely, 2112113211301 is an apocalyptic number.
It is an amenable number.
112113211301 is a deficient number, since it is larger than the sum of its proper divisors (25872279643).
112113211301 is a wasteful number, since it uses less digits than its factorization.
112113211301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1232013331.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 112113211301 its reverse (103112311211), we get a palindrome (215225522512).
The spelling of 112113211301 in words is "one hundred twelve billion, one hundred thirteen million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •