Base | Representation |
---|---|
bin | 11111101001101… |
… | …100100010011101 |
3 | 1101000012211000122 |
4 | 133221230202131 |
5 | 2041420232104 |
6 | 124405404325 |
7 | 16105426004 |
oct | 3751544235 |
9 | 1330184018 |
10 | 531024029 |
11 | 252827238 |
12 | 129a096a5 |
13 | 86028203 |
14 | 5074dc3b |
15 | 319456be |
hex | 1fa6c89d |
531024029 has 2 divisors, whose sum is σ = 531024030. Its totient is φ = 531024028.
The previous prime is 531024007. The next prime is 531024031. The reversal of 531024029 is 920420135.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 523723225 + 7300804 = 22885^2 + 2702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-531024029 is a prime.
It is a Sophie Germain prime.
Together with 531024031, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 531023989 and 531024007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (531024929) 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, 265512014 + 265512015.
It is an arithmetic number, because the mean of its divisors is an integer number (265512015).
Almost surely, 2531024029 is an apocalyptic number.
It is an amenable number.
531024029 is a deficient number, since it is larger than the sum of its proper divisors (1).
531024029 is an equidigital number, since it uses as much as digits as its factorization.
531024029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 531024029 is about 23043.9586225978. The cubic root of 531024029 is about 809.7881013565.
The spelling of 531024029 in words is "five hundred thirty-one million, twenty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •