Base | Representation |
---|---|
bin | 110100110011111010… |
… | …001010100100110000 |
3 | 12102100220022212012210 |
4 | 310303322022210300 |
5 | 1412113044214103 |
6 | 42014454452120 |
7 | 4045133314233 |
oct | 646372124460 |
9 | 172326285183 |
10 | 56705460528 |
11 | 22059832872 |
12 | aba6664040 |
13 | 546903a452 |
14 | 2a5d0d941a |
15 | 171d3cce03 |
hex | d33e8a930 |
56705460528 has 20 divisors (see below), whose sum is σ = 146489106488. Its totient is φ = 18901820160.
The previous prime is 56705460433. The next prime is 56705460529. The reversal of 56705460528 is 82506450765.
It is a happy number.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 1181363761 = 56705460528 / (5 + 6 + 7 + 0 + 5 + 4 + 6 + 0 + 5 + 2 + 8).
It is not an unprimeable number, because it can be changed into a prime (56705460529) 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 in 3 ways as a sum of consecutive naturals, for example, 590681833 + ... + 590681928.
Almost surely, 256705460528 is an apocalyptic number.
It is an amenable number.
56705460528 is an abundant number, since it is smaller than the sum of its proper divisors (89783645960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56705460528 is a wasteful number, since it uses less digits than its factorization.
56705460528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181363772 (or 1181363766 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 48.
The spelling of 56705460528 in words is "fifty-six billion, seven hundred five million, four hundred sixty thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •