Base | Representation |
---|---|
bin | 1000000001101000100101010… |
… | …1010001011010101010101001 |
3 | 2202001121020220011112021020111 |
4 | 2000122021111101122222221 |
5 | 1043010302200134130243 |
6 | 5321041013210054321 |
7 | 226645413131546512 |
oct | 20032112521325251 |
9 | 2661536804467214 |
10 | 564746680380073 |
11 | 153a447a4182644 |
12 | 5340b83471a3a1 |
13 | 1b3174ca585ab9 |
14 | 9d65c56cc1a09 |
15 | 454555572c39d |
hex | 201a25545aaa9 |
564746680380073 has 2 divisors, whose sum is σ = 564746680380074. Its totient is φ = 564746680380072.
The previous prime is 564746680380017. The next prime is 564746680380097. The reversal of 564746680380073 is 370083086647465.
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., 285739367245929 + 279007313134144 = 16903827^2 + 16703512^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-564746680380073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 564746680379990 and 564746680380008.
It is not a weakly prime, because it can be changed into another prime (564746680380373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282373340190036 + 282373340190037.
It is an arithmetic number, because the mean of its divisors is an integer number (282373340190037).
Almost surely, 2564746680380073 is an apocalyptic number.
It is an amenable number.
564746680380073 is a deficient number, since it is larger than the sum of its proper divisors (1).
564746680380073 is an equidigital number, since it uses as much as digits as its factorization.
564746680380073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 487710720, while the sum is 67.
The spelling of 564746680380073 in words is "five hundred sixty-four trillion, seven hundred forty-six billion, six hundred eighty million, three hundred eighty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •