Base | Representation |
---|---|
bin | 110100010000011100… |
… | …110011011101110101 |
3 | 12100211102220211200011 |
4 | 310100130303131311 |
5 | 1404403300424031 |
6 | 41435444020221 |
7 | 4024320620545 |
oct | 642034633565 |
9 | 170742824604 |
10 | 56110561141 |
11 | 21883a49088 |
12 | aa5b391671 |
13 | 53a2a0938b |
14 | 2a040bd325 |
15 | 16d606b6b1 |
hex | d10733775 |
56110561141 has 2 divisors, whose sum is σ = 56110561142. Its totient is φ = 56110561140.
The previous prime is 56110560991. The next prime is 56110561183. The reversal of 56110561141 is 14116501165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41930752900 + 14179808241 = 204770^2 + 119079^2 .
It is a cyclic number.
It is not a de Polignac number, because 56110561141 - 29 = 56110560629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56110567141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28055280570 + 28055280571.
It is an arithmetic number, because the mean of its divisors is an integer number (28055280571).
Almost surely, 256110561141 is an apocalyptic number.
It is an amenable number.
56110561141 is a deficient number, since it is larger than the sum of its proper divisors (1).
56110561141 is an equidigital number, since it uses as much as digits as its factorization.
56110561141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 31.
The spelling of 56110561141 in words is "fifty-six billion, one hundred ten million, five hundred sixty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •