Base | Representation |
---|---|
bin | 11111100110110… |
… | …010010011100101 |
3 | 1100221210001122111 |
4 | 133212302103211 |
5 | 2041221324341 |
6 | 124341201021 |
7 | 16066101040 |
oct | 3746622345 |
9 | 1327701574 |
10 | 530261221 |
11 | 252356116 |
12 | 129700171 |
13 | 85b1bc49 |
14 | 505d1c57 |
15 | 31844681 |
hex | 1f9b24e5 |
530261221 has 8 divisors (see below), whose sum is σ = 607314240. Its totient is φ = 453533568.
The previous prime is 530261203. The next prime is 530261243. The reversal of 530261221 is 122162035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 530261221 - 213 = 530253029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530261192 and 530261201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530261521) 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 in 7 ways as a sum of consecutive naturals, for example, 77836 + ... + 84373.
It is an arithmetic number, because the mean of its divisors is an integer number (75914280).
Almost surely, 2530261221 is an apocalyptic number.
It is an amenable number.
530261221 is a deficient number, since it is larger than the sum of its proper divisors (77053019).
530261221 is a wasteful number, since it uses less digits than its factorization.
530261221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162683.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 530261221 is about 23027.4015251396. The cubic root of 530261221 is about 809.4001660824.
It can be divided in two parts, 53026 and 1221, that multiplied together give a palindrome (64744746).
The spelling of 530261221 in words is "five hundred thirty million, two hundred sixty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •