Base | Representation |
---|---|
bin | 110100011010101100… |
… | …0000100001000010001 |
3 | 101202112211020201111010 |
4 | 1220311120010020101 |
5 | 3321013022304023 |
6 | 123413403041133 |
7 | 11063312512440 |
oct | 1506530041021 |
9 | 352484221433 |
10 | 112564650513 |
11 | 438138a0a97 |
12 | 199958101a9 |
13 | a7cb943ca3 |
14 | 563ba62d57 |
15 | 2ddc344093 |
hex | 1a35604211 |
112564650513 has 8 divisors (see below), whose sum is σ = 171527086528. Its totient is φ = 64322657424.
The previous prime is 112564650463. The next prime is 112564650557. The reversal of 112564650513 is 315056465211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112564650513 - 28 = 112564650257 is a prime.
It is a super-2 number, since 2×1125646505132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112564650613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2680110706 + ... + 2680110747.
It is an arithmetic number, because the mean of its divisors is an integer number (21440885816).
Almost surely, 2112564650513 is an apocalyptic number.
It is an amenable number.
112564650513 is a deficient number, since it is larger than the sum of its proper divisors (58962436015).
112564650513 is an equidigital number, since it uses as much as digits as its factorization.
112564650513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5360221463.
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 112564650513 in words is "one hundred twelve billion, five hundred sixty-four million, six hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •