Base | Representation |
---|---|
bin | 11111101001010… |
… | …001010011000000 |
3 | 1101000000010222000 |
4 | 133221101103000 |
5 | 2041403144243 |
6 | 124403144000 |
7 | 16104452463 |
oct | 3751212300 |
9 | 1330003860 |
10 | 530912448 |
11 | 252760420 |
12 | 129975000 |
13 | 85cb94a1 |
14 | 507212da |
15 | 319225d3 |
hex | 1fa514c0 |
530912448 has 448 divisors, whose sum is σ = 1896099840. Its totient is φ = 143769600.
The previous prime is 530912441. The next prime is 530912461. The reversal of 530912448 is 844219035.
It is a super-3 number, since 3×5309124483 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (530912441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10017190 + ... + 10017242.
Almost surely, 2530912448 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 530912448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (948049920).
530912448 is an abundant number, since it is smaller than the sum of its proper divisors (1365187392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530912448 is a wasteful number, since it uses less digits than its factorization.
530912448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 530912448 is about 23041.5374487034. The cubic root of 530912448 is about 809.7313786907.
The spelling of 530912448 in words is "five hundred thirty million, nine hundred twelve thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •