Base | Representation |
---|---|
bin | 11111100110100… |
… | …100111110000101 |
3 | 1100221200021201101 |
4 | 133212210332011 |
5 | 2041213102342 |
6 | 124340100101 |
7 | 16065452554 |
oct | 3746447605 |
9 | 1327607641 |
10 | 530206597 |
11 | 252319078 |
12 | 129694631 |
13 | 85b0011b |
14 | 505b9d9b |
15 | 318333b7 |
hex | 1f9a4f85 |
530206597 has 2 divisors, whose sum is σ = 530206598. Its totient is φ = 530206596.
The previous prime is 530206561. The next prime is 530206613. The reversal of 530206597 is 795602035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 394856641 + 135349956 = 19871^2 + 11634^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530206597 is a prime.
It is a super-2 number, since 2×5302065972 = 562238071004640818, which contains 22 as substring.
It is equal to p27861049 and since 530206597 and 27861049 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530206697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265103298 + 265103299.
It is an arithmetic number, because the mean of its divisors is an integer number (265103299).
Almost surely, 2530206597 is an apocalyptic number.
It is an amenable number.
530206597 is a deficient number, since it is larger than the sum of its proper divisors (1).
530206597 is an equidigital number, since it uses as much as digits as its factorization.
530206597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 37.
The square root of 530206597 is about 23026.2154293753. The cubic root of 530206597 is about 809.3723721127.
The spelling of 530206597 in words is "five hundred thirty million, two hundred six thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •