Base | Representation |
---|---|
bin | 11111100111101… |
… | …101111011101010 |
3 | 1100222020110200000 |
4 | 133213231323222 |
5 | 2041302133300 |
6 | 124350323430 |
7 | 16101136056 |
oct | 3747557352 |
9 | 1328213600 |
10 | 530505450 |
11 | 252502662 |
12 | 1297b9576 |
13 | 85ba6167 |
14 | 50656c66 |
15 | 31891c00 |
hex | 1f9edeea |
530505450 has 144 divisors (see below), whose sum is σ = 1511153280. Its totient is φ = 138309120.
The previous prime is 530505427. The next prime is 530505457. The reversal of 530505450 is 54505035.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530505457) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 570586 + ... + 571514.
It is an arithmetic number, because the mean of its divisors is an integer number (10494120).
Almost surely, 2530505450 is an apocalyptic number.
530505450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 530505450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (755576640).
530505450 is an abundant number, since it is smaller than the sum of its proper divisors (980647830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530505450 is a wasteful number, since it uses less digits than its factorization.
530505450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003 (or 986 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 27.
The square root of 530505450 is about 23032.7039229006. The cubic root of 530505450 is about 809.5244121734.
The spelling of 530505450 in words is "five hundred thirty million, five hundred five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •