Base | Representation |
---|---|
bin | 11001101100101100000010… |
… | …11011000010000011110000 |
3 | 21102002101220122211121021121 |
4 | 30312112001123002003300 |
5 | 24401334120322420111 |
6 | 320104453141232024 |
7 | 14621534435653651 |
oct | 1466260133020360 |
9 | 242071818747247 |
10 | 56511056060656 |
11 | 170082279a6a4a |
12 | 640827a402614 |
13 | 256bc7b626062 |
14 | dd5214b21528 |
15 | 67eeb0190871 |
hex | 3365816c20f0 |
56511056060656 has 40 divisors (see below), whose sum is σ = 109736557462400. Its totient is φ = 28191967268544.
The previous prime is 56511056060647. The next prime is 56511056060699. The reversal of 56511056060656 is 65606065011565.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39083695 + ... + 40503793.
It is an arithmetic number, because the mean of its divisors is an integer number (2743413936560).
Almost surely, 256511056060656 is an apocalyptic number.
It is an amenable number.
56511056060656 is a deficient number, since it is larger than the sum of its proper divisors (53225501401744).
56511056060656 is a wasteful number, since it uses less digits than its factorization.
56511056060656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1425701 (or 1425695 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 52.
The spelling of 56511056060656 in words is "fifty-six trillion, five hundred eleven billion, fifty-six million, sixty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •