Base | Representation |
---|---|
bin | 1000000001101010011011100… |
… | …0001001110101011101000001 |
3 | 2202001201021210001022121221021 |
4 | 2000122212320021311131001 |
5 | 1043011312132422424342 |
6 | 5321103341135425441 |
7 | 226650615232024504 |
oct | 20032467011653501 |
9 | 2661637701277837 |
10 | 564778404108097 |
11 | 153a571a3415a93 |
12 | 53415a08985281 |
13 | 1b31a4b4ab46ba |
14 | 9d675c622b13b |
15 | 45462b0845567 |
hex | 201a9b8275741 |
564778404108097 has 2 divisors, whose sum is σ = 564778404108098. Its totient is φ = 564778404108096.
The previous prime is 564778404108089. The next prime is 564778404108101. The reversal of 564778404108097 is 790801404877465.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 552099563246401 + 12678840861696 = 23496799^2 + 3560736^2 .
It is a cyclic number.
It is not a de Polignac number, because 564778404108097 - 23 = 564778404108089 is a prime.
It is a super-4 number, since 4×5647784041080974 (a number of 60 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (564778404108697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282389202054048 + 282389202054049.
It is an arithmetic number, because the mean of its divisors is an integer number (282389202054049).
Almost surely, 2564778404108097 is an apocalyptic number.
It is an amenable number.
564778404108097 is a deficient number, since it is larger than the sum of its proper divisors (1).
564778404108097 is an equidigital number, since it uses as much as digits as its factorization.
564778404108097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 379330560, while the sum is 70.
The spelling of 564778404108097 in words is "five hundred sixty-four trillion, seven hundred seventy-eight billion, four hundred four million, one hundred eight thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •