Base | Representation |
---|---|
bin | 11001101110000000000010… |
… | …10100111011000001001000 |
3 | 21102020201022110002011000210 |
4 | 30313000001110323001020 |
5 | 24403103444303144220 |
6 | 320141312023401120 |
7 | 14625022105601652 |
oct | 1467000124730110 |
9 | 242221273064023 |
10 | 56556151615560 |
11 | 17025369197893 |
12 | 6414b648b31a0 |
13 | 25732b728265c |
14 | dd7491d456d2 |
15 | 68124e1a66e0 |
hex | 33700153b048 |
56556151615560 has 128 divisors (see below), whose sum is σ = 177047819815680. Its totient is φ = 14425715217408.
The previous prime is 56556151615489. The next prime is 56556151615573. The reversal of 56556151615560 is 6551615165565.
It is a super-2 number, since 2×565561516155602 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56556151615560.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 379361994 + ... + 379511046.
It is an arithmetic number, because the mean of its divisors is an integer number (1383186092310).
Almost surely, 256556151615560 is an apocalyptic number.
It is an amenable number.
56556151615560 is an abundant number, since it is smaller than the sum of its proper divisors (120491668200120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56556151615560 is a wasteful number, since it uses less digits than its factorization.
56556151615560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286567 (or 286563 counting only the distinct ones).
The product of its (nonzero) digits is 20250000, while the sum is 57.
The spelling of 56556151615560 in words is "fifty-six trillion, five hundred fifty-six billion, one hundred fifty-one million, six hundred fifteen thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •