Base | Representation |
---|---|
bin | 11111100110010… |
… | …010111000101101 |
3 | 1100221112112002222 |
4 | 133212102320231 |
5 | 2041203220100 |
6 | 124334325125 |
7 | 16065023606 |
oct | 3746227055 |
9 | 1327475088 |
10 | 530132525 |
11 | 25227845a |
12 | 1296597a5 |
13 | 85aa54b0 |
14 | 5059adad |
15 | 3181b485 |
hex | 1f992e2d |
530132525 has 12 divisors (see below), whose sum is σ = 707931252. Its totient is φ = 391482240.
The previous prime is 530132507. The next prime is 530132527. The reversal of 530132525 is 525231035.
It can be written as a sum of positive squares in 6 ways, for example, as 117961321 + 412171204 = 10861^2 + 20302^2 .
It is not a de Polignac number, because 530132525 - 28 = 530132269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 530132494 and 530132503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530132527) 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 11 ways as a sum of consecutive naturals, for example, 815264 + ... + 815913.
It is an arithmetic number, because the mean of its divisors is an integer number (58994271).
Almost surely, 2530132525 is an apocalyptic number.
It is an amenable number.
530132525 is a deficient number, since it is larger than the sum of its proper divisors (177798727).
530132525 is a wasteful number, since it uses less digits than its factorization.
530132525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631200 (or 1631195 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 530132525 is about 23024.6069456136. The cubic root of 530132525 is about 809.3346794958.
The spelling of 530132525 in words is "five hundred thirty million, one hundred thirty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •