Base | Representation |
---|---|
bin | 100001101001000… |
… | …111011100101101 |
3 | 1110100001211122201 |
4 | 201221013130231 |
5 | 2123443122131 |
6 | 132001341501 |
7 | 16662355300 |
oct | 4151073455 |
9 | 1410054581 |
10 | 564426541 |
11 | 26a671018 |
12 | 139037891 |
13 | 8cc21b03 |
14 | 54d66b37 |
15 | 34842761 |
hex | 21a4772d |
564426541 has 12 divisors (see below), whose sum is σ = 672594300. Its totient is φ = 471992640.
The previous prime is 564426539. The next prime is 564426547. The reversal of 564426541 is 145624465.
564426541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 336869316 + 227557225 = 18354^2 + 15085^2 .
It is not a de Polignac number, because 564426541 - 21 = 564426539 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 564426541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (564426547) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 138466 + ... + 142483.
It is an arithmetic number, because the mean of its divisors is an integer number (56049525).
Almost surely, 2564426541 is an apocalyptic number.
It is an amenable number.
564426541 is a deficient number, since it is larger than the sum of its proper divisors (108167759).
564426541 is a wasteful number, since it uses less digits than its factorization.
564426541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281004 (or 280997 counting only the distinct ones).
The product of its digits is 115200, while the sum is 37.
The square root of 564426541 is about 23757.6627848785. The cubic root of 564426541 is about 826.4231529066.
The spelling of 564426541 in words is "five hundred sixty-four million, four hundred twenty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •