Base | Representation |
---|---|
bin | 1101100000010… |
… | …1011011001000 |
3 | 10221120212202211 |
4 | 3120011123020 |
5 | 104000122240 |
6 | 5342034504 |
7 | 1255322464 |
oct | 330053310 |
9 | 127525684 |
10 | 56645320 |
11 | 29a7a516 |
12 | 16b78a34 |
13 | b974054 |
14 | 77474a4 |
15 | 4e8dbea |
hex | 36056c8 |
56645320 has 48 divisors (see below), whose sum is σ = 133284060. Its totient is φ = 21664896.
The previous prime is 56645279. The next prime is 56645341. The reversal of 56645320 is 2354665.
It can be written as a sum of positive squares in 2 ways, for example, as 48246916 + 8398404 = 6946^2 + 2898^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19822 + ... + 22498.
Almost surely, 256645320 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56645320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66642030).
56645320 is an abundant number, since it is smaller than the sum of its proper divisors (76638740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56645320 is a wasteful number, since it uses less digits than its factorization.
56645320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2734 (or 2707 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 56645320 is about 7526.3085241040. The cubic root of 56645320 is about 384.0502140642.
Adding to 56645320 its reverse (2354665), we get a palindrome (58999985).
It can be divided in two parts, 56645 and 320, that added together give a palindrome (56965).
The spelling of 56645320 in words is "fifty-six million, six hundred forty-five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •