Base | Representation |
---|---|
bin | 110100101010111100… |
… | …001110010010000101 |
3 | 12101222102012221010002 |
4 | 310222330032102011 |
5 | 1411311040130221 |
6 | 41551522011045 |
7 | 4041325416452 |
oct | 645274162205 |
9 | 171872187102 |
10 | 56555005061 |
11 | 21a9190a405 |
12 | ab641a6a85 |
13 | 5443b0c149 |
14 | 2a47132829 |
15 | 17100ad80b |
hex | d2af0e485 |
56555005061 has 2 divisors, whose sum is σ = 56555005062. Its totient is φ = 56555005060.
The previous prime is 56555005037. The next prime is 56555005099. The reversal of 56555005061 is 16050055565.
It is an a-pointer prime, because the next prime (56555005099) can be obtained adding 56555005061 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54525052036 + 2029953025 = 233506^2 + 45055^2 .
It is a cyclic number.
It is not a de Polignac number, because 56555005061 - 26 = 56555004997 is a prime.
It is a super-2 number, since 2×565550050612 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56555005261) 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, 28277502530 + 28277502531.
It is an arithmetic number, because the mean of its divisors is an integer number (28277502531).
Almost surely, 256555005061 is an apocalyptic number.
It is an amenable number.
56555005061 is a deficient number, since it is larger than the sum of its proper divisors (1).
56555005061 is an equidigital number, since it uses as much as digits as its factorization.
56555005061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 56555005061 in words is "fifty-six billion, five hundred fifty-five million, five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •