Base | Representation |
---|---|
bin | 100001101001100… |
… | …011111101110000 |
3 | 1110100021202212202 |
4 | 201221203331300 |
5 | 2124010341334 |
6 | 132004042332 |
7 | 16663352651 |
oct | 4151437560 |
9 | 1410252782 |
10 | 564543344 |
11 | 26a740852 |
12 | 1390933a8 |
13 | 8cc63021 |
14 | 54d97528 |
15 | 3486717e |
hex | 21a63f70 |
564543344 has 40 divisors (see below), whose sum is σ = 1164644208. Its totient is φ = 264176640.
The previous prime is 564543337. The next prime is 564543347. The reversal of 564543344 is 443345465.
564543344 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 564543298 and 564543307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564543347) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43499 + ... + 54965.
Almost surely, 2564543344 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 564543344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (582322104).
564543344 is an abundant number, since it is smaller than the sum of its proper divisors (600100864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
564543344 is a wasteful number, since it uses less digits than its factorization.
564543344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11673 (or 11667 counting only the distinct ones).
The product of its digits is 345600, while the sum is 38.
The square root of 564543344 is about 23760.1208751134. The cubic root of 564543344 is about 826.4801559228.
The spelling of 564543344 in words is "five hundred sixty-four million, five hundred forty-three thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •