Base | Representation |
---|---|
bin | 110100110000101000… |
… | …010101101111111001 |
3 | 12102020001211100021011 |
4 | 310300220111233321 |
5 | 1412010004043212 |
6 | 42005211513521 |
7 | 4043564634316 |
oct | 646050255771 |
9 | 172201740234 |
10 | 56650456057 |
11 | 22030784128 |
12 | ab901588a1 |
13 | 545a81c220 |
14 | 2a55a9bd0d |
15 | 17186654a7 |
hex | d30a15bf9 |
56650456057 has 8 divisors (see below), whose sum is σ = 61020013320. Its totient is φ = 52282588800.
The previous prime is 56650456043. The next prime is 56650456063. The reversal of 56650456057 is 75065405665.
It can be written as a sum of positive squares in 4 ways, for example, as 7197146896 + 49453309161 = 84836^2 + 222381^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-56650456057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56650456057.
It is not an unprimeable number, because it can be changed into a prime (56650456097) 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, 352444 + ... + 487357.
It is an arithmetic number, because the mean of its divisors is an integer number (7627501665).
Almost surely, 256650456057 is an apocalyptic number.
It is an amenable number.
56650456057 is a deficient number, since it is larger than the sum of its proper divisors (4369557263).
56650456057 is a wasteful number, since it uses less digits than its factorization.
56650456057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845003.
The product of its (nonzero) digits is 3780000, while the sum is 49.
The spelling of 56650456057 in words is "fifty-six billion, six hundred fifty million, four hundred fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •