Base | Representation |
---|---|
bin | 11111101000101… |
… | …101001011010101 |
3 | 1100222201122000111 |
4 | 133220231023111 |
5 | 2041333431001 |
6 | 124400043021 |
7 | 16103265241 |
oct | 3750551325 |
9 | 1328648014 |
10 | 530764501 |
11 | 25266a253 |
12 | 129903471 |
13 | 85c67047 |
14 | 506c3421 |
15 | 318e3851 |
hex | 1fa2d2d5 |
530764501 has 2 divisors, whose sum is σ = 530764502. Its totient is φ = 530764500.
The previous prime is 530764483. The next prime is 530764517. The reversal of 530764501 is 105467035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 463540900 + 67223601 = 21530^2 + 8199^2 .
It is a cyclic number.
It is not a de Polignac number, because 530764501 - 25 = 530764469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530764301) 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, 265382250 + 265382251.
It is an arithmetic number, because the mean of its divisors is an integer number (265382251).
Almost surely, 2530764501 is an apocalyptic number.
It is an amenable number.
530764501 is a deficient number, since it is larger than the sum of its proper divisors (1).
530764501 is an equidigital number, since it uses as much as digits as its factorization.
530764501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 530764501 is about 23038.3267838617. The cubic root of 530764501 is about 809.6561569611.
The spelling of 530764501 in words is "five hundred thirty million, seven hundred sixty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •