Base | Representation |
---|---|
bin | 1111011100001010000… |
… | …00101100010001110100 |
3 | 1212201100022220202112200 |
4 | 13232011000230101310 |
5 | 32142442201403000 |
6 | 1043414124344500 |
7 | 53220411042363 |
oct | 7560500542164 |
9 | 1781308822480 |
10 | 530512528500 |
11 | 194a975457a9 |
12 | 869976a5130 |
13 | 3b047763676 |
14 | 1b9697657da |
15 | dbee74c500 |
hex | 7b8502c474 |
530512528500 has 72 divisors (see below), whose sum is σ = 1673590204104. Its totient is φ = 141470006400.
The previous prime is 530512528499. The next prime is 530512528523. The reversal of 530512528500 is 5825215035.
530512528500 is a `hidden beast` number, since 5 + 3 + 0 + 5 + 125 + 28 + 500 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 20982101904 + 509530426596 = 144852^2 + 713814^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58941337 + ... + 58950336.
Almost surely, 2530512528500 is an apocalyptic number.
530512528500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
530512528500 is an abundant number, since it is smaller than the sum of its proper divisors (1143077675604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530512528500 is a wasteful number, since it uses less digits than its factorization.
530512528500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117891698 (or 117891683 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 530512528500 in words is "five hundred thirty billion, five hundred twelve million, five hundred twenty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •