Base | Representation |
---|---|
bin | 11111101000111… |
… | …011111001000001 |
3 | 1100222211200200122 |
4 | 133220323321001 |
5 | 2041342343034 |
6 | 124401230025 |
7 | 16103636036 |
oct | 3750737101 |
9 | 1328750618 |
10 | 530824769 |
11 | 252700562 |
12 | 129932315 |
13 | 85c885c7 |
14 | 506db38d |
15 | 3190662e |
hex | 1fa3be41 |
530824769 has 2 divisors, whose sum is σ = 530824770. Its totient is φ = 530824768.
The previous prime is 530824759. The next prime is 530824771. The reversal of 530824769 is 967428035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 430023169 + 100801600 = 20737^2 + 10040^2 .
It is a cyclic number.
It is not a de Polignac number, because 530824769 - 220 = 529776193 is a prime.
It is a super-2 number, since 2×5308247692 = 563549870767806722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 530824771, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (530824759) 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, 265412384 + 265412385.
It is an arithmetic number, because the mean of its divisors is an integer number (265412385).
Almost surely, 2530824769 is an apocalyptic number.
It is an amenable number.
530824769 is a deficient number, since it is larger than the sum of its proper divisors (1).
530824769 is an equidigital number, since it uses as much as digits as its factorization.
530824769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The square root of 530824769 is about 23039.6347410283. The cubic root of 530824769 is about 809.6868011296.
The spelling of 530824769 in words is "five hundred thirty million, eight hundred twenty-four thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •