Base | Representation |
---|---|
bin | 11001101110010010101011… |
… | …00101011100001101100101 |
3 | 21102021200010121112012012212 |
4 | 30313021111211130031211 |
5 | 24403234441210312230 |
6 | 320150044414253205 |
7 | 14625525025433462 |
oct | 1467112545341545 |
9 | 242250117465185 |
10 | 56566155166565 |
11 | 17029631a07810 |
12 | 6416a96ab7205 |
13 | 257421c9141c5 |
14 | dd7b60750669 |
15 | 681637516895 |
hex | 33725595c365 |
56566155166565 has 8 divisors (see below), whose sum is σ = 74050239490848. Its totient is φ = 41139021939280.
The previous prime is 56566155166559. The next prime is 56566155166589.
It is a happy number.
56566155166565 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 56566155166565 - 26 = 56566155166501 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56566155166495 and 56566155166504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 514237774187 + ... + 514237774296.
It is an arithmetic number, because the mean of its divisors is an integer number (9256279936356).
Almost surely, 256566155166565 is an apocalyptic number.
56566155166565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56566155166565 is a deficient number, since it is larger than the sum of its proper divisors (17484084324283).
56566155166565 is a wasteful number, since it uses less digits than its factorization.
56566155166565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1028475548499.
The product of its digits is 729000000, while the sum is 68.
The spelling of 56566155166565 in words is "fifty-six trillion, five hundred sixty-six billion, one hundred fifty-five million, one hundred sixty-six thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •