Search a number
-
+
530712000 = 263653713
BaseRepresentation
bin11111101000100…
…000010111000000
31100222121222000000
4133220200113000
52041330241000
6124355000000
716102656210
oct3750402700
91328558000
10530712000
11252633865
12129899000
1385c49190
14506ac240
15318d3000
hex1fa205c0

530712000 has 784 divisors, whose sum is σ = 2425305792. Its totient is φ = 111974400.

The previous prime is 530711969. The next prime is 530712011. The reversal of 530712000 is 217035.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 40823994 + ... + 40824006.

Almost surely, 2530712000 is an apocalyptic number.

530712000 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 530712000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1212652896).

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

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

530712000 is an equidigital number, since it uses as much as digits as its factorization.

530712000 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 65 (or 30 counting only the distinct ones).

The product of its (nonzero) digits is 210, while the sum is 18.

The square root of 530712000 is about 23037.1873283177. The cubic root of 530712000 is about 809.6294601496.

Adding to 530712000 its reverse (217035), we get a palindrome (530929035).

The spelling of 530712000 in words is "five hundred thirty million, seven hundred twelve thousand".