530506470 has 64 divisors (see below), whose sum is σ = 1381302720. Its totient is φ = 129619968.

The previous prime is 530506463. The next prime is 530506513. The reversal of 530506470 is 74605035.

It is a super-2 number, since 2×530506470² = 562874229423721800, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (30).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48466 + ... + 58394.

It is an arithmetic number, because the mean of its divisors is an integer number (21582855).

Almost surely, 2^530506470 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 530506470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (690651360).

530506470 is an abundant number, since it is smaller than the sum of its proper divisors (850796250).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

530506470 is a wasteful number, since it uses less digits than its factorization.

530506470 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 10089.

The product of its (nonzero) digits is 12600, while the sum is 30.

The square root of 530506470 is about 23032.7260653185. The cubic root of 530506470 is about 809.5249309959.

The spelling of 530506470 in words is "five hundred thirty million, five hundred six thousand, four hundred seventy".