Base | Representation |
---|---|
bin | 11111100111110… |
… | …001010110110000 |
3 | 1100222021011220100 |
4 | 133213301112300 |
5 | 2041303110342 |
6 | 124350512400 |
7 | 16101225000 |
oct | 3747612660 |
9 | 1328234810 |
10 | 530519472 |
11 | 25251214a |
12 | 129805700 |
13 | 85bac662 |
14 | 5065c000 |
15 | 31895e4c |
hex | 1f9f15b0 |
530519472 has 240 divisors, whose sum is σ = 1810598400. Its totient is φ = 144676224.
The previous prime is 530519443. The next prime is 530519497. The reversal of 530519472 is 274915035.
530519472 is a `hidden beast` number, since 530 + 51 + 9 + 4 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 47 ways as a sum of consecutive naturals, for example, 1135783 + ... + 1136249.
It is an arithmetic number, because the mean of its divisors is an integer number (7544160).
Almost surely, 2530519472 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 530519472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (905299200).
530519472 is an abundant number, since it is smaller than the sum of its proper divisors (1280078928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530519472 is a wasteful number, since it uses less digits than its factorization.
530519472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525 (or 502 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 530519472 is about 23033.0083141564. The cubic root of 530519472 is about 809.5315443976.
The spelling of 530519472 in words is "five hundred thirty million, five hundred nineteen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •