Base | Representation |
---|---|
bin | 110100101000010110… |
… | …011111100110100101 |
3 | 12101212101110200211111 |
4 | 310220112133212211 |
5 | 1411213424410401 |
6 | 41543330505021 |
7 | 4040260222663 |
oct | 645026374645 |
9 | 171771420744 |
10 | 56511560101 |
11 | 21a6a336587 |
12 | ab51735171 |
13 | 5437b0a579 |
14 | 2a41463c33 |
15 | 170b37ae51 |
hex | d2859f9a5 |
56511560101 has 8 divisors (see below), whose sum is σ = 56792403360. Its totient is φ = 56231345808.
The previous prime is 56511560071. The next prime is 56511560113. The reversal of 56511560101 is 10106511565.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56511560101 - 211 = 56511558053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56511560401) 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 7 ways as a sum of consecutive naturals, for example, 23415 + ... + 337003.
It is an arithmetic number, because the mean of its divisors is an integer number (7099050420).
Almost surely, 256511560101 is an apocalyptic number.
It is an amenable number.
56511560101 is a deficient number, since it is larger than the sum of its proper divisors (280843259).
56511560101 is a wasteful number, since it uses less digits than its factorization.
56511560101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314483.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 56511560101 in words is "fifty-six billion, five hundred eleven million, five hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •