Base | Representation |
---|---|
bin | 11001101100101100000010… |
… | …11011000010000011100111 |
3 | 21102002101220122211121021021 |
4 | 30312112001123002003213 |
5 | 24401334120322420042 |
6 | 320104453141232011 |
7 | 14621534435653636 |
oct | 1466260133020347 |
9 | 242071818747237 |
10 | 56511056060647 |
11 | 170082279a6a41 |
12 | 640827a402607 |
13 | 256bc7b626056 |
14 | dd5214b2151d |
15 | 67eeb0190867 |
hex | 3365816c20e7 |
56511056060647 has 2 divisors, whose sum is σ = 56511056060648. Its totient is φ = 56511056060646.
The previous prime is 56511056060609. The next prime is 56511056060699. The reversal of 56511056060647 is 74606065011565.
It is an a-pointer prime, because the next prime (56511056060699) can be obtained adding 56511056060647 to its sum of digits (52).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56511056060647 - 27 = 56511056060519 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56511056060594 and 56511056060603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56511056090647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28255528030323 + 28255528030324.
It is an arithmetic number, because the mean of its divisors is an integer number (28255528030324).
Almost surely, 256511056060647 is an apocalyptic number.
56511056060647 is a deficient number, since it is larger than the sum of its proper divisors (1).
56511056060647 is an equidigital number, since it uses as much as digits as its factorization.
56511056060647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536000, while the sum is 52.
The spelling of 56511056060647 in words is "fifty-six trillion, five hundred eleven billion, fifty-six million, sixty thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •