Base | Representation |
---|---|
bin | 110100101011000010… |
… | …101110111010000001 |
3 | 12101222112102121222111 |
4 | 310223002232322001 |
5 | 1411312004232203 |
6 | 41552022335321 |
7 | 4041346054606 |
oct | 645302567201 |
9 | 171875377874 |
10 | 56556711553 |
11 | 21a92875531 |
12 | ab6488a541 |
13 | 5444288ac4 |
14 | 2a474586ad |
15 | 17102e926d |
hex | d2b0aee81 |
56556711553 has 2 divisors, whose sum is σ = 56556711554. Its totient is φ = 56556711552.
The previous prime is 56556711521. The next prime is 56556711571. The reversal of 56556711553 is 35511765565.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40205463169 + 16351248384 = 200513^2 + 127872^2 .
It is a cyclic number.
It is not a de Polignac number, because 56556711553 - 25 = 56556711521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56556711497 and 56556711506.
It is not a weakly prime, because it can be changed into another prime (56556711353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28278355776 + 28278355777.
It is an arithmetic number, because the mean of its divisors is an integer number (28278355777).
Almost surely, 256556711553 is an apocalyptic number.
It is an amenable number.
56556711553 is a deficient number, since it is larger than the sum of its proper divisors (1).
56556711553 is an equidigital number, since it uses as much as digits as its factorization.
56556711553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2362500, while the sum is 49.
The spelling of 56556711553 in words is "fifty-six billion, five hundred fifty-six million, seven hundred eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.797 sec. • engine limits •