Base | Representation |
---|---|
bin | 100001101011001… |
… | …000110011111100 |
3 | 1110101001202111120 |
4 | 201223020303330 |
5 | 2124112101122 |
6 | 132020550540 |
7 | 20000023146 |
oct | 4153106374 |
9 | 1411052446 |
10 | 564956412 |
11 | 26a9a3129 |
12 | 139252450 |
13 | 90079047 |
14 | 55063c96 |
15 | 348e975c |
hex | 21ac8cfc |
564956412 has 48 divisors (see below), whose sum is σ = 1395730560. Its totient is φ = 177363648.
The previous prime is 564956411. The next prime is 564956419. The reversal of 564956412 is 214659465.
564956412 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564956411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32283 + ... + 46605.
It is an arithmetic number, because the mean of its divisors is an integer number (29077720).
Almost surely, 2564956412 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 564956412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (697865280).
564956412 is an abundant number, since it is smaller than the sum of its proper divisors (830774148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
564956412 is a wasteful number, since it uses less digits than its factorization.
564956412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14522 (or 14520 counting only the distinct ones).
The product of its digits is 259200, while the sum is 42.
The square root of 564956412 is about 23768.8117498541. The cubic root of 564956412 is about 826.6816812078.
The spelling of 564956412 in words is "five hundred sixty-four million, nine hundred fifty-six thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •