Base | Representation |
---|---|
bin | 110100101000010100… |
… | …100011011110111101 |
3 | 12101212100111212110011 |
4 | 310220110203132331 |
5 | 1411213312123314 |
6 | 41543311543221 |
7 | 4040253004540 |
oct | 645024433675 |
9 | 171770455404 |
10 | 56511051709 |
11 | 21a6a019622 |
12 | ab5152ab11 |
13 | 5437990048 |
14 | 2a41370857 |
15 | 170b2ca4c4 |
hex | d285237bd |
56511051709 has 16 divisors (see below), whose sum is σ = 65029030528. Its totient is φ = 48105461952.
The previous prime is 56511051691. The next prime is 56511051733. The reversal of 56511051709 is 90715011565.
It is a cyclic number.
It is not a de Polignac number, because 56511051709 - 27 = 56511051581 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56511051749) 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 in 15 ways as a sum of consecutive naturals, for example, 547807 + ... + 642739.
It is an arithmetic number, because the mean of its divisors is an integer number (4064314408).
Almost surely, 256511051709 is an apocalyptic number.
It is an amenable number.
56511051709 is a deficient number, since it is larger than the sum of its proper divisors (8517978819).
56511051709 is a wasteful number, since it uses less digits than its factorization.
56511051709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95524.
The product of its (nonzero) digits is 47250, while the sum is 40.
The spelling of 56511051709 in words is "fifty-six billion, five hundred eleven million, fifty-one thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •