Base | Representation |
---|---|
bin | 11111101000011… |
… | …110100101011100 |
3 | 1100222121121000211 |
4 | 133220132211130 |
5 | 2041330022412 |
6 | 124354502204 |
7 | 16102626055 |
oct | 3750364534 |
9 | 1328547024 |
10 | 530704732 |
11 | 252629358 |
12 | 129894964 |
13 | 85c45a8c |
14 | 506a972c |
15 | 318d0ca7 |
hex | 1fa1e95c |
530704732 has 12 divisors (see below), whose sum is σ = 977614120. Its totient is φ = 251386416.
The previous prime is 530704729. The next prime is 530704763. The reversal of 530704732 is 237407035.
It is a junction number, because it is equal to n+sod(n) for n = 530704694 and 530704703.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3491403 + ... + 3491554.
Almost surely, 2530704732 is an apocalyptic number.
It is an amenable number.
530704732 is a deficient number, since it is larger than the sum of its proper divisors (446909388).
530704732 is a wasteful number, since it uses less digits than its factorization.
530704732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6982980 (or 6982978 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 31.
The square root of 530704732 is about 23037.0295828260. The cubic root of 530704732 is about 809.6257642255.
The spelling of 530704732 in words is "five hundred thirty million, seven hundred four thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •