Base | Representation |
---|---|
bin | 11111100111110… |
… | …011010100110101 |
3 | 1100222021120222012 |
4 | 133213303110311 |
5 | 2041303340131 |
6 | 124351014005 |
7 | 16101260345 |
oct | 3747632465 |
9 | 1328246865 |
10 | 530527541 |
11 | 252518215 |
12 | 12980a305 |
13 | 85bb322b |
14 | 50660d25 |
15 | 3189852b |
hex | 1f9f3535 |
530527541 has 2 divisors, whose sum is σ = 530527542. Its totient is φ = 530527540.
The previous prime is 530527513. The next prime is 530527561. The reversal of 530527541 is 145725035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 365918641 + 164608900 = 19129^2 + 12830^2 .
It is a cyclic number.
It is not a de Polignac number, because 530527541 - 210 = 530526517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530527498 and 530527507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530527561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265263770 + 265263771.
It is an arithmetic number, because the mean of its divisors is an integer number (265263771).
Almost surely, 2530527541 is an apocalyptic number.
It is an amenable number.
530527541 is a deficient number, since it is larger than the sum of its proper divisors (1).
530527541 is an equidigital number, since it uses as much as digits as its factorization.
530527541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 32.
The square root of 530527541 is about 23033.1834751517. The cubic root of 530527541 is about 809.5356485994.
The spelling of 530527541 in words is "five hundred thirty million, five hundred twenty-seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •