Base | Representation |
---|---|
bin | 11111100110110… |
… | …101101100101001 |
3 | 1100221210202201000 |
4 | 133212311230221 |
5 | 2041222300423 |
6 | 124341345213 |
7 | 16066156404 |
oct | 3746655451 |
9 | 1327722630 |
10 | 530275113 |
11 | 2523655a5 |
12 | 129708209 |
13 | 85b25374 |
14 | 505d6d3b |
15 | 31848843 |
hex | 1f9b5b29 |
530275113 has 8 divisors (see below), whose sum is σ = 785592800. Its totient is φ = 353516724.
The previous prime is 530275111. The next prime is 530275129. The reversal of 530275113 is 311572035.
It is not a de Polignac number, because 530275113 - 21 = 530275111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 19639819 = 530275113 / (5 + 3 + 0 + 2 + 7 + 5 + 1 + 1 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530275111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9819883 + ... + 9819936.
It is an arithmetic number, because the mean of its divisors is an integer number (98199100).
Almost surely, 2530275113 is an apocalyptic number.
It is an amenable number.
530275113 is a deficient number, since it is larger than the sum of its proper divisors (255317687).
530275113 is a wasteful number, since it uses less digits than its factorization.
530275113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19639828 (or 19639822 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 530275113 is about 23027.7031637982. The cubic root of 530275113 is about 809.4072343527.
The spelling of 530275113 in words is "five hundred thirty million, two hundred seventy-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •