Base | Representation |
---|---|
bin | 11001101111010001111101… |
… | …10011001100111101110011 |
3 | 21102101220211120010111122102 |
4 | 30313220332303030331303 |
5 | 24404314032423332111 |
6 | 320213424133331015 |
7 | 14631140023241621 |
oct | 1467507663147563 |
9 | 242356746114572 |
10 | 56600132636531 |
11 | 17041a88346900 |
12 | 6421599a96a6b |
13 | 25774a603cb13 |
14 | dd9665126511 |
15 | 68247541513b |
hex | 337a3ecccf73 |
56600132636531 has 6 divisors (see below), whose sum is σ = 62213368931196. Its totient is φ = 51454666033100.
The previous prime is 56600132636507. The next prime is 56600132636543. The reversal of 56600132636531 is 13563623100665.
It is a de Polignac number, because none of the positive numbers 2k-56600132636531 is a prime.
It is a super-2 number, since 2×566001326365312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56600132636561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 233884845485 + ... + 233884845726.
It is an arithmetic number, because the mean of its divisors is an integer number (10368894821866).
Almost surely, 256600132636531 is an apocalyptic number.
56600132636531 is a deficient number, since it is larger than the sum of its proper divisors (5613236294665).
56600132636531 is a wasteful number, since it uses less digits than its factorization.
56600132636531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467769691233 (or 467769691222 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 47.
The spelling of 56600132636531 in words is "fifty-six trillion, six hundred billion, one hundred thirty-two million, six hundred thirty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •