Base | Representation |
---|---|
bin | 110100101011011110… |
… | …101101101010101111 |
3 | 12102000001020021122121 |
4 | 310223132231222233 |
5 | 1411320343442021 |
6 | 41552443453411 |
7 | 4041465314410 |
oct | 645336555257 |
9 | 172001207577 |
10 | 56564046511 |
11 | 21a96a25385 |
12 | ab67227267 |
13 | 544595660b |
14 | 2a48407807 |
15 | 1710c97741 |
hex | d2b7adaaf |
56564046511 has 32 divisors (see below), whose sum is σ = 66358673408. Its totient is φ = 47215405440.
The previous prime is 56564046503. The next prime is 56564046529. The reversal of 56564046511 is 11564046565.
It is not a de Polignac number, because 56564046511 - 23 = 56564046503 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56564046551) by changing a digit.
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, 39749146 + ... + 39750568.
It is an arithmetic number, because the mean of its divisors is an integer number (2073708544).
Almost surely, 256564046511 is an apocalyptic number.
56564046511 is a deficient number, since it is larger than the sum of its proper divisors (9794626897).
56564046511 is a wasteful number, since it uses less digits than its factorization.
56564046511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2351.
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 56564046511 in words is "fifty-six billion, five hundred sixty-four million, forty-six thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •