Base | Representation |
---|---|
bin | 110100011010000101… |
… | …0100001110000110111 |
3 | 101202111102000001122212 |
4 | 1220310022201300313 |
5 | 3320442321342123 |
6 | 123411355244035 |
7 | 11062644655421 |
oct | 1506412416067 |
9 | 352442001585 |
10 | 112544324663 |
11 | 43803378971 |
12 | 1998aa4961b |
13 | a7c7678464 |
14 | 5639091811 |
15 | 2dda67b878 |
hex | 1a342a1c37 |
112544324663 has 4 divisors (see below), whose sum is σ = 112548794688. Its totient is φ = 112539854640.
The previous prime is 112544324549. The next prime is 112544324699. The reversal of 112544324663 is 366423445211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112544324663 - 216 = 112544259127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112544324663.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112544324863) 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 3 ways as a sum of consecutive naturals, for example, 2197031 + ... + 2247672.
It is an arithmetic number, because the mean of its divisors is an integer number (28137198672).
Almost surely, 2112544324663 is an apocalyptic number.
112544324663 is a deficient number, since it is larger than the sum of its proper divisors (4470025).
112544324663 is an equidigital number, since it uses as much as digits as its factorization.
112544324663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4470024.
The product of its digits is 414720, while the sum is 41.
Adding to 112544324663 its reverse (366423445211), we get a palindrome (478967769874).
The spelling of 112544324663 in words is "one hundred twelve billion, five hundred forty-four million, three hundred twenty-four thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •