Base | Representation |
---|---|
bin | 110100100111111011… |
… | …010101001011111011 |
3 | 12101211220001221021021 |
4 | 310213323111023323 |
5 | 1411210114031142 |
6 | 41542514123311 |
7 | 4040142545233 |
oct | 644773251373 |
9 | 171756057237 |
10 | 56504439547 |
11 | 21a66312826 |
12 | ab4b280537 |
13 | 54364b651a |
14 | 2a4052ccc3 |
15 | 170a921267 |
hex | d27ed52fb |
56504439547 has 2 divisors, whose sum is σ = 56504439548. Its totient is φ = 56504439546.
The previous prime is 56504439533. The next prime is 56504439599. The reversal of 56504439547 is 74593440565.
It is an a-pointer prime, because the next prime (56504439599) can be obtained adding 56504439547 to its sum of digits (52).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56504439547 - 215 = 56504406779 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56504439494 and 56504439503.
It is not a weakly prime, because it can be changed into another prime (56504439517) 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 as a sum of consecutive naturals, namely, 28252219773 + 28252219774.
It is an arithmetic number, because the mean of its divisors is an integer number (28252219774).
Almost surely, 256504439547 is an apocalyptic number.
56504439547 is a deficient number, since it is larger than the sum of its proper divisors (1).
56504439547 is an equidigital number, since it uses as much as digits as its factorization.
56504439547 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072000, while the sum is 52.
The spelling of 56504439547 in words is "fifty-six billion, five hundred four million, four hundred thirty-nine thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •