Base | Representation |
---|---|
bin | 1000000001101000100100101… |
… | …0111001000110100011011001 |
3 | 2202001121020110000211201211122 |
4 | 2000122021022321012203121 |
5 | 1043010301321043442243 |
6 | 5321040544025335025 |
7 | 226645405615412312 |
oct | 20032111271064331 |
9 | 2661536400751748 |
10 | 564746506234073 |
11 | 153a44714949129 |
12 | 5340b7a6337475 |
13 | 1b3174a0481627 |
14 | 9d65c3bb0d609 |
15 | 45455452cd668 |
hex | 201a24ae468d9 |
564746506234073 has 2 divisors, whose sum is σ = 564746506234074. Its totient is φ = 564746506234072.
The previous prime is 564746506233953. The next prime is 564746506234111. The reversal of 564746506234073 is 370432605647465.
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., 446956552974409 + 117789953259664 = 21141347^2 + 10853108^2 .
It is a cyclic number.
It is not a de Polignac number, because 564746506234073 - 28 = 564746506233817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 564746506233997 and 564746506234015.
It is not a weakly prime, because it can be changed into another prime (564746506234973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282373253117036 + 282373253117037.
It is an arithmetic number, because the mean of its divisors is an integer number (282373253117037).
Almost surely, 2564746506234073 is an apocalyptic number.
It is an amenable number.
564746506234073 is a deficient number, since it is larger than the sum of its proper divisors (1).
564746506234073 is an equidigital number, since it uses as much as digits as its factorization.
564746506234073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 304819200, while the sum is 62.
The spelling of 564746506234073 in words is "five hundred sixty-four trillion, seven hundred forty-six billion, five hundred six million, two hundred thirty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •