Base | Representation |
---|---|
bin | 110100101000101001… |
… | …111101000100111101 |
3 | 12101212202001212201121 |
4 | 310220221331010331 |
5 | 1411221231132230 |
6 | 41544032110541 |
7 | 4040351461030 |
oct | 645051750475 |
9 | 171782055647 |
10 | 56516661565 |
11 | 21a72200371 |
12 | ab53395451 |
13 | 5438ba55a0 |
14 | 2a41dd1017 |
15 | 170ba3777a |
hex | d28a7d13d |
56516661565 has 256 divisors, whose sum is σ = 96984760320. Its totient is φ = 30601359360.
The previous prime is 56516661563. The next prime is 56516661583.
56516661565 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56516661565 - 21 = 56516661563 is a prime.
Its product of digits (4860000) is a multiple of the sum of its prime divisors (324).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56516661563) by changing a digit.
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 255 ways as a sum of consecutive naturals, for example, 326685819 + ... + 326685991.
It is an arithmetic number, because the mean of its divisors is an integer number (378846720).
Almost surely, 256516661565 is an apocalyptic number.
It is an amenable number.
56516661565 is a deficient number, since it is larger than the sum of its proper divisors (40468098755).
56516661565 is a wasteful number, since it uses less digits than its factorization.
56516661565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324.
The product of its digits is 4860000, while the sum is 52.
The spelling of 56516661565 in words is "fifty-six billion, five hundred sixteen million, six hundred sixty-one thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •