Base | Representation |
---|---|
bin | 100001101011010… |
… | …000111000010101 |
3 | 1110101010102211121 |
4 | 201223100320111 |
5 | 2124114130321 |
6 | 132021403541 |
7 | 20000221411 |
oct | 4153207025 |
9 | 1411112747 |
10 | 564989461 |
11 | 26aa15a43 |
12 | 1392695b1 |
13 | 9008b0ba |
14 | 55071d41 |
15 | 34904441 |
hex | 21ad0e15 |
564989461 has 2 divisors, whose sum is σ = 564989462. Its totient is φ = 564989460.
The previous prime is 564989429. The next prime is 564989473. The reversal of 564989461 is 164989465.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 538518436 + 26471025 = 23206^2 + 5145^2 .
It is a cyclic number.
It is not a de Polignac number, because 564989461 - 25 = 564989429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 564989399 and 564989408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (564980461) 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 as a sum of consecutive naturals, namely, 282494730 + 282494731.
It is an arithmetic number, because the mean of its divisors is an integer number (282494731).
Almost surely, 2564989461 is an apocalyptic number.
It is an amenable number.
564989461 is a deficient number, since it is larger than the sum of its proper divisors (1).
564989461 is an equidigital number, since it uses as much as digits as its factorization.
564989461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1866240, while the sum is 52.
The square root of 564989461 is about 23769.5069574444. The cubic root of 564989461 is about 826.6978007229.
It can be divided in two parts, 564 and 989461, that added together give a square (990025 = 9952).
The spelling of 564989461 in words is "five hundred sixty-four million, nine hundred eighty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •