Base | Representation |
---|---|
bin | 11111101000011… |
… | …001010011111100 |
3 | 1100222120111101211 |
4 | 133220121103330 |
5 | 2041323330012 |
6 | 124354214204 |
7 | 16102506100 |
oct | 3750312374 |
9 | 1328514354 |
10 | 530683132 |
11 | 252614101 |
12 | 129884364 |
13 | 85c38cb5 |
14 | 506a1900 |
15 | 318c96a7 |
hex | 1fa194fc |
530683132 has 36 divisors (see below), whose sum is σ = 1094026080. Its totient is φ = 224550144.
The previous prime is 530683123. The next prime is 530683147. The reversal of 530683132 is 231386035.
It is a junction number, because it is equal to n+sod(n) for n = 530683094 and 530683103.
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 11 ways as a sum of consecutive naturals, for example, 1653 + ... + 32620.
Almost surely, 2530683132 is an apocalyptic number.
It is an amenable number.
530683132 is an abundant number, since it is smaller than the sum of its proper divisors (563342948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530683132 is a wasteful number, since it uses less digits than its factorization.
530683132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34370 (or 34361 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 530683132 is about 23036.5607676146. The cubic root of 530683132 is about 809.6147799922.
The spelling of 530683132 in words is "five hundred thirty million, six hundred eighty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •