Base | Representation |
---|---|
bin | 110100101011001011… |
… | …000001101010111101 |
3 | 12101222200112002011110 |
4 | 310223023001222331 |
5 | 1411313033314230 |
6 | 41552141112233 |
7 | 4041403411050 |
oct | 645313015275 |
9 | 171880462143 |
10 | 56558885565 |
11 | 21a9401a936 |
12 | ab65558679 |
13 | 544486a4c0 |
14 | 2a47862a97 |
15 | 17105c84b0 |
hex | d2b2c1abd |
56558885565 has 32 divisors (see below), whose sum is σ = 111377500416. Its totient is φ = 23866606080.
The previous prime is 56558885519. The next prime is 56558885599.
56558885565 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56558885565 - 218 = 56558623421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56558885496 and 56558885505.
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 20716176 + ... + 20718905.
It is an arithmetic number, because the mean of its divisors is an integer number (3480546888).
Almost surely, 256558885565 is an apocalyptic number.
It is an amenable number.
56558885565 is a deficient number, since it is larger than the sum of its proper divisors (54818614851).
56558885565 is a wasteful number, since it uses less digits than its factorization.
56558885565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41435109.
The product of its digits is 288000000, while the sum is 66.
The spelling of 56558885565 in words is "fifty-six billion, five hundred fifty-eight million, eight hundred eighty-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •