Base | Representation |
---|---|
bin | 11001101101010010001001… |
… | …01010011001000111011101 |
3 | 21102011100201020101021110121 |
4 | 30312221010222121013131 |
5 | 24402203013421413230 |
6 | 320122115020434541 |
7 | 14623160361310624 |
oct | 1466510452310735 |
9 | 242140636337417 |
10 | 56531511513565 |
11 | 17015974526530 |
12 | 64102289a8a51 |
13 | 2570b8b48964a |
14 | dd61d56c46bb |
15 | 6807aadc577a |
hex | 336a44a991dd |
56531511513565 has 32 divisors (see below), whose sum is σ = 76629624600960. Its totient is φ = 39658337376000.
The previous prime is 56531511513479. The next prime is 56531511513583.
56531511513565 is nontrivially palindromic in base 10.
56531511513565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56531511513565 - 27 = 56531511513437 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15185194 + ... + 18537883.
It is an arithmetic number, because the mean of its divisors is an integer number (2394675768780).
Almost surely, 256531511513565 is an apocalyptic number.
56531511513565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56531511513565 is a deficient number, since it is larger than the sum of its proper divisors (20098113087395).
56531511513565 is a wasteful number, since it uses less digits than its factorization.
56531511513565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33724173.
The product of its digits is 5062500, while the sum is 52.
The spelling of 56531511513565 in words is "fifty-six trillion, five hundred thirty-one billion, five hundred eleven million, five hundred thirteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •