Base | Representation |
---|---|
bin | 11111100111000… |
… | …001101010101101 |
3 | 1100221220020221212 |
4 | 133213001222231 |
5 | 2041230333031 |
6 | 124342404205 |
7 | 16066452344 |
oct | 3747015255 |
9 | 1327806855 |
10 | 530324141 |
11 | 252399416 |
12 | 129730665 |
13 | 85b41789 |
14 | 5060ab5b |
15 | 3185812b |
hex | 1f9c1aad |
530324141 has 2 divisors, whose sum is σ = 530324142. Its totient is φ = 530324140.
The previous prime is 530324083. The next prime is 530324149. The reversal of 530324141 is 141423035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 529230025 + 1094116 = 23005^2 + 1046^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530324141 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530324149) 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, 265162070 + 265162071.
It is an arithmetic number, because the mean of its divisors is an integer number (265162071).
Almost surely, 2530324141 is an apocalyptic number.
It is an amenable number.
530324141 is a deficient number, since it is larger than the sum of its proper divisors (1).
530324141 is an equidigital number, since it uses as much as digits as its factorization.
530324141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 530324141 is about 23028.7676830524. The cubic root of 530324141 is about 809.4321788856.
Adding to 530324141 its reverse (141423035), we get a palindrome (671747176).
The spelling of 530324141 in words is "five hundred thirty million, three hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •