Base | Representation |
---|---|
bin | 110100011100101001… |
… | …0101010011110111101 |
3 | 101202201101212021110220 |
4 | 1220321102222132331 |
5 | 3321131331443423 |
6 | 123424111051553 |
7 | 11065041060504 |
oct | 1507122523675 |
9 | 352641767426 |
10 | 112630343613 |
11 | 43847990207 |
12 | 199b3810bb9 |
13 | a80c435348 |
14 | 564668383b |
15 | 2de2ebd9e3 |
hex | 1a394aa7bd |
112630343613 has 4 divisors (see below), whose sum is σ = 150173791488. Its totient is φ = 75086895740.
The previous prime is 112630343597. The next prime is 112630343629. The reversal of 112630343613 is 316343036211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (112630343597) and next prime (112630343629).
It is a cyclic number.
It is not a de Polignac number, because 112630343613 - 24 = 112630343597 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112630393613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18771723933 + ... + 18771723938.
It is an arithmetic number, because the mean of its divisors is an integer number (37543447872).
Almost surely, 2112630343613 is an apocalyptic number.
It is an amenable number.
112630343613 is a deficient number, since it is larger than the sum of its proper divisors (37543447875).
112630343613 is an equidigital number, since it uses as much as digits as its factorization.
112630343613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37543447874.
The product of its (nonzero) digits is 23328, while the sum is 33.
Adding to 112630343613 its reverse (316343036211), we get a palindrome (428973379824).
The spelling of 112630343613 in words is "one hundred twelve billion, six hundred thirty million, three hundred forty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •