Base | Representation |
---|---|
bin | 100001100111111… |
… | …001101110111000 |
3 | 1110022110122222220 |
4 | 201213321232320 |
5 | 2123402430331 |
6 | 131550444040 |
7 | 16656561240 |
oct | 4147715670 |
9 | 1408418886 |
10 | 564108216 |
11 | 26a473941 |
12 | 138b03620 |
13 | 8cb3cc59 |
14 | 54cc2b20 |
15 | 347cd296 |
hex | 219f9bb8 |
564108216 has 128 divisors (see below), whose sum is σ = 1669032960. Its totient is φ = 155520000.
The previous prime is 564108199. The next prime is 564108227. The reversal of 564108216 is 612801465.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 938316 + ... + 938916.
It is an arithmetic number, because the mean of its divisors is an integer number (13039320).
Almost surely, 2564108216 is an apocalyptic number.
564108216 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 564108216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (834516480).
564108216 is an abundant number, since it is smaller than the sum of its proper divisors (1104924744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
564108216 is a wasteful number, since it uses less digits than its factorization.
564108216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805 (or 801 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 564108216 is about 23750.9624226051. The cubic root of 564108216 is about 826.2677617842.
The spelling of 564108216 in words is "five hundred sixty-four million, one hundred eight thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •