Base | Representation |
---|---|
bin | 11111101000011… |
… | …110011111001011 |
3 | 1100222121120110222 |
4 | 133220132133023 |
5 | 2041330014311 |
6 | 124354500255 |
7 | 16102624643 |
oct | 3750363713 |
9 | 1328546428 |
10 | 530704331 |
11 | 252629023 |
12 | 12989468b |
13 | 85c45841 |
14 | 506a9523 |
15 | 318d0adb |
hex | 1fa1e7cb |
530704331 has 4 divisors (see below), whose sum is σ = 539404464. Its totient is φ = 522004200.
The previous prime is 530704267. The next prime is 530704337. The reversal of 530704331 is 133407035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 530704331 - 26 = 530704267 is a prime.
It is a super-2 number, since 2×5307043312 = 563294173884315122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 530704331.
It is not an unprimeable number, because it can be changed into a prime (530704337) 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 in 3 ways as a sum of consecutive naturals, for example, 4349975 + ... + 4350096.
It is an arithmetic number, because the mean of its divisors is an integer number (134851116).
Almost surely, 2530704331 is an apocalyptic number.
530704331 is a deficient number, since it is larger than the sum of its proper divisors (8700133).
530704331 is an equidigital number, since it uses as much as digits as its factorization.
530704331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8700132.
The product of its (nonzero) digits is 3780, while the sum is 26.
The square root of 530704331 is about 23037.0208794453. The cubic root of 530704331 is about 809.6255603080.
The spelling of 530704331 in words is "five hundred thirty million, seven hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •