Base | Representation |
---|---|
bin | 1111011100001000111… |
… | …00011101111011010000 |
3 | 1212201022200001022112000 |
4 | 13232010130131323100 |
5 | 32142432234020103 |
6 | 1043413145034000 |
7 | 53220234242340 |
oct | 7560434357320 |
9 | 1781280038460 |
10 | 530503032528 |
11 | 194a9214a297 |
12 | 86994485900 |
13 | 3b0457ba351 |
14 | 1b9683b2d20 |
15 | dbed9c3aa3 |
hex | 7b8471ded0 |
530503032528 has 80 divisors (see below), whose sum is σ = 1740274508160. Its totient is φ = 151572294144.
The previous prime is 530503032511. The next prime is 530503032539. The reversal of 530503032528 is 825230305035.
530503032528 is a `hidden beast` number, since 5 + 305 + 0 + 3 + 0 + 325 + 28 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 530503032492 and 530503032501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87712425 + ... + 87718472.
It is an arithmetic number, because the mean of its divisors is an integer number (21753431352).
Almost surely, 2530503032528 is an apocalyptic number.
It is an amenable number.
530503032528 is an abundant number, since it is smaller than the sum of its proper divisors (1209771475632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530503032528 is a wasteful number, since it uses less digits than its factorization.
530503032528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175430921 (or 175430909 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 530503032528 in words is "five hundred thirty billion, five hundred three million, thirty-two thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •