Base | Representation |
---|---|
bin | 11111101001000… |
… | …100100000000000 |
3 | 1100222220111001200 |
4 | 133221010200000 |
5 | 2041400010112 |
6 | 124402101200 |
7 | 16104143613 |
oct | 3751044000 |
9 | 1328814050 |
10 | 530860032 |
11 | 252724aaa |
12 | 12994a800 |
13 | 85c9b681 |
14 | 5070a17a |
15 | 31911cdc |
hex | 1fa44800 |
530860032 has 144 divisors (see below), whose sum is σ = 1556165520. Its totient is φ = 174317568.
The previous prime is 530860021. The next prime is 530860049. The reversal of 530860032 is 230068035.
530860032 is a `hidden beast` number, since 53 + 0 + 8 + 600 + 3 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a junction number, because it is equal to n+sod(n) for n = 530859978 and 530860005.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1529683 + ... + 1530029.
It is an arithmetic number, because the mean of its divisors is an integer number (10806705).
Almost surely, 2530860032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 530860032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (778082760).
530860032 is an abundant number, since it is smaller than the sum of its proper divisors (1025305488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530860032 is a wasteful number, since it uses less digits than its factorization.
530860032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458 (or 435 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 530860032 is about 23040.3999965278. The cubic root of 530860032 is about 809.7047300553.
The spelling of 530860032 in words is "five hundred thirty million, eight hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •