Base | Representation |
---|---|
bin | 11111101001010… |
… | …110001100111001 |
3 | 1101000001011112001 |
4 | 133221112030321 |
5 | 2041404320122 |
6 | 124403421001 |
7 | 16104565162 |
oct | 3751261471 |
9 | 1330034461 |
10 | 530932537 |
11 | 252774523 |
12 | 129984761 |
13 | 85cc5685 |
14 | 50728769 |
15 | 31928527 |
hex | 1fa56339 |
530932537 has 2 divisors, whose sum is σ = 530932538. Its totient is φ = 530932536.
The previous prime is 530932487. The next prime is 530932543. The reversal of 530932537 is 735239035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 279424656 + 251507881 = 16716^2 + 15859^2 .
It is a cyclic number.
It is not a de Polignac number, because 530932537 - 211 = 530930489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530932496 and 530932505.
It is not a weakly prime, because it can be changed into another prime (530932037) 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, 265466268 + 265466269.
It is an arithmetic number, because the mean of its divisors is an integer number (265466269).
Almost surely, 2530932537 is an apocalyptic number.
It is an amenable number.
530932537 is a deficient number, since it is larger than the sum of its proper divisors (1).
530932537 is an equidigital number, since it uses as much as digits as its factorization.
530932537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85050, while the sum is 37.
The square root of 530932537 is about 23041.9733746917. The cubic root of 530932537 is about 809.7415916040.
The spelling of 530932537 in words is "five hundred thirty million, nine hundred thirty-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •