Base | Representation |
---|---|
bin | 1000000000011010011000001… |
… | …1101000110111100100011101 |
3 | 2201212211210222002001220210002 |
4 | 2000012212003220313210131 |
5 | 1042321244104140003221 |
6 | 5314131454302024045 |
7 | 226446350602620656 |
oct | 20006460350674435 |
9 | 2655753862056702 |
10 | 563403133516061 |
11 | 153576a21a86a43 |
12 | 53233375578025 |
13 | 1b24a8c2641907 |
14 | 9d1ac0008c52d |
15 | 452061d75780b |
hex | 2006983a3791d |
563403133516061 has 2 divisors, whose sum is σ = 563403133516062. Its totient is φ = 563403133516060.
The previous prime is 563403133516031. The next prime is 563403133516151. The reversal of 563403133516061 is 160615331304365.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 437475123800836 + 125928009715225 = 20915906^2 + 11221765^2 .
It is a cyclic number.
It is not a de Polignac number, because 563403133516061 - 242 = 559005087004957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 563403133515997 and 563403133516015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (563403133516001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 281701566758030 + 281701566758031.
It is an arithmetic number, because the mean of its divisors is an integer number (281701566758031).
Almost surely, 2563403133516061 is an apocalyptic number.
It is an amenable number.
563403133516061 is a deficient number, since it is larger than the sum of its proper divisors (1).
563403133516061 is an equidigital number, since it uses as much as digits as its factorization.
563403133516061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 47.
The spelling of 563403133516061 in words is "five hundred sixty-three trillion, four hundred three billion, one hundred thirty-three million, five hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •