Base | Representation |
---|---|
bin | 110100010011001010… |
… | …0010010001001011001 |
3 | 101201220012211210122221 |
4 | 1220212110102021121 |
5 | 3320003333013423 |
6 | 123332335544041 |
7 | 11054124154324 |
oct | 1504624221131 |
9 | 351805753587 |
10 | 112312001113 |
11 | 436a4218834 |
12 | 1992508b021 |
13 | a78b4b46c0 |
14 | 56162977bb |
15 | 2dc5089e5d |
hex | 1a26512259 |
112312001113 has 8 divisors (see below), whose sum is σ = 121627094400. Its totient is φ = 103093437648.
The previous prime is 112312000967. The next prime is 112312001213. The reversal of 112312001113 is 311100213211.
It is a happy number.
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 112312001113 - 233 = 103722066521 is a prime.
It is a super-2 number, since 2×1123120011132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112312001213) 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, 24130033 + ... + 24134686.
It is an arithmetic number, because the mean of its divisors is an integer number (15203386800).
Almost surely, 2112312001113 is an apocalyptic number.
112312001113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
112312001113 is a deficient number, since it is larger than the sum of its proper divisors (9315093287).
112312001113 is a wasteful number, since it uses less digits than its factorization.
112312001113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48264911.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 112312001113 its reverse (311100213211), we get a palindrome (423412214324).
The spelling of 112312001113 in words is "one hundred twelve billion, three hundred twelve million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •