Base | Representation |
---|---|
bin | 11111100111111… |
… | …010000101000000 |
3 | 1100222022222220121 |
4 | 133213322011000 |
5 | 2041310231300 |
6 | 124351350024 |
7 | 16101434110 |
oct | 3747720500 |
9 | 1328288817 |
10 | 530555200 |
11 | 252536a7a |
12 | 129822314 |
13 | 85bc29b6 |
14 | 5066b040 |
15 | 318a181a |
hex | 1f9fa140 |
530555200 has 168 divisors, whose sum is σ = 1507776512. Its totient is φ = 179988480.
The previous prime is 530555197. The next prime is 530555243. The reversal of 530555200 is 2555035.
530555200 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1422214 + ... + 1422586.
Almost surely, 2530555200 is an apocalyptic number.
530555200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 530555200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (753888256).
530555200 is an abundant number, since it is smaller than the sum of its proper divisors (977221312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530555200 is a wasteful number, since it uses less digits than its factorization.
530555200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529 (or 514 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 25.
The square root of 530555200 is about 23033.7838836783. The cubic root of 530555200 is about 809.5497167081.
The spelling of 530555200 in words is "five hundred thirty million, five hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •