Base | Representation |
---|---|
bin | 100001100111101… |
… | …101000011011001 |
3 | 1110022101000202101 |
4 | 201213231003121 |
5 | 2123344300111 |
6 | 131545403401 |
7 | 16656253645 |
oct | 4147550331 |
9 | 1408330671 |
10 | 564056281 |
11 | 26a438918 |
12 | 138a99561 |
13 | 8cb22419 |
14 | 54cabc25 |
15 | 347bcbc1 |
hex | 219ed0d9 |
564056281 has 2 divisors, whose sum is σ = 564056282. Its totient is φ = 564056280.
The previous prime is 564056239. The next prime is 564056291. The reversal of 564056281 is 182650465.
564056281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 534025881 + 30030400 = 23109^2 + 5480^2 .
It is a cyclic number.
It is not a de Polignac number, because 564056281 - 217 = 563925209 is a prime.
It is a super-2 number, since 2×5640562812 = 636318976271101922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 564056281.
It is not a weakly prime, because it can be changed into another prime (564056201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282028140 + 282028141.
It is an arithmetic number, because the mean of its divisors is an integer number (282028141).
Almost surely, 2564056281 is an apocalyptic number.
It is an amenable number.
564056281 is a deficient number, since it is larger than the sum of its proper divisors (1).
564056281 is an equidigital number, since it uses as much as digits as its factorization.
564056281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 564056281 is about 23749.8690733233. The cubic root of 564056281 is about 826.2424040414.
The spelling of 564056281 in words is "five hundred sixty-four million, fifty-six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •