Base | Representation |
---|---|
bin | 11111100110011… |
… | …001110110101101 |
3 | 1100221120222021011 |
4 | 133212121312231 |
5 | 2041210123234 |
6 | 124335105221 |
7 | 16065203044 |
oct | 3746316655 |
9 | 1327528234 |
10 | 530161069 |
11 | 252297949 |
12 | 129672211 |
13 | 85ab5499 |
14 | 505a755b |
15 | 31824b64 |
hex | 1f999dad |
530161069 has 2 divisors, whose sum is σ = 530161070. Its totient is φ = 530161068.
The previous prime is 530161013. The next prime is 530161087. The reversal of 530161069 is 960161035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 512479044 + 17682025 = 22638^2 + 4205^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530161069 is a prime.
It is a super-2 number, since 2×5301610692 = 562141518166445522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 530161069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530161369) 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, 265080534 + 265080535.
It is an arithmetic number, because the mean of its divisors is an integer number (265080535).
Almost surely, 2530161069 is an apocalyptic number.
It is an amenable number.
530161069 is a deficient number, since it is larger than the sum of its proper divisors (1).
530161069 is an equidigital number, since it uses as much as digits as its factorization.
530161069 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 31.
The square root of 530161069 is about 23025.2267958429. The cubic root of 530161069 is about 809.3492049421.
The spelling of 530161069 in words is "five hundred thirty million, one hundred sixty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •