Base | Representation |
---|---|
bin | 11111100110010… |
… | …101011111011001 |
3 | 1100221120001202002 |
4 | 133212111133121 |
5 | 2041204040233 |
6 | 124334450345 |
7 | 16065066656 |
oct | 3746253731 |
9 | 1327501662 |
10 | 530143193 |
11 | 252285478 |
12 | 1296639b5 |
13 | 85aaa2c8 |
14 | 505a0c2d |
15 | 3181e6e8 |
hex | 1f9957d9 |
530143193 has 2 divisors, whose sum is σ = 530143194. Its totient is φ = 530143192.
The previous prime is 530143093. The next prime is 530143213. The reversal of 530143193 is 391341035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 521802649 + 8340544 = 22843^2 + 2888^2 .
It is a cyclic number.
It is not a de Polignac number, because 530143193 - 220 = 529094617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (530143093) 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, 265071596 + 265071597.
It is an arithmetic number, because the mean of its divisors is an integer number (265071597).
Almost surely, 2530143193 is an apocalyptic number.
It is an amenable number.
530143193 is a deficient number, since it is larger than the sum of its proper divisors (1).
530143193 is an equidigital number, since it uses as much as digits as its factorization.
530143193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 29.
The square root of 530143193 is about 23024.8386096407. The cubic root of 530143193 is about 809.3401082796.
The spelling of 530143193 in words is "five hundred thirty million, one hundred forty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •