Base | Representation |
---|---|
bin | 100001101000010… |
… | …011010110101001 |
3 | 1110022122222221202 |
4 | 201220103112221 |
5 | 2123414310121 |
6 | 131553013545 |
7 | 16660506221 |
oct | 4150232651 |
9 | 1408588852 |
10 | 564213161 |
11 | 26a535776 |
12 | 138b542b5 |
13 | 8cb78955 |
14 | 54d0d081 |
15 | 347ee40b |
hex | 21a135a9 |
564213161 has 8 divisors (see below), whose sum is σ = 592646784. Its totient is φ = 536104800.
The previous prime is 564213157. The next prime is 564213179. The reversal of 564213161 is 161312465.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 564213161 - 22 = 564213157 is a prime.
It is a super-2 number, since 2×5642131612 = 636672982091223842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (564213101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77756 + ... + 84701.
It is an arithmetic number, because the mean of its divisors is an integer number (74080848).
Almost surely, 2564213161 is an apocalyptic number.
It is an amenable number.
564213161 is a deficient number, since it is larger than the sum of its proper divisors (28433623).
564213161 is a wasteful number, since it uses less digits than its factorization.
564213161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162631.
The product of its digits is 4320, while the sum is 29.
The square root of 564213161 is about 23753.1715987571. The cubic root of 564213161 is about 826.3189973988.
The spelling of 564213161 in words is "five hundred sixty-four million, two hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •