Base | Representation |
---|---|
bin | 1111011100001001001… |
… | …01001000110110011100 |
3 | 1212201022211022210110011 |
4 | 13232010211020312130 |
5 | 32142433324234000 |
6 | 1043413305453004 |
7 | 53220262460152 |
oct | 7560445106634 |
9 | 1781284283404 |
10 | 530505305500 |
11 | 194a93461a85 |
12 | 869951a1164 |
13 | 3b046104ac1 |
14 | 1b9688053d2 |
15 | dbedcc22ba |
hex | 7b84948d9c |
530505305500 has 48 divisors (see below), whose sum is σ = 1167080844384. Its totient is φ = 210653174400.
The previous prime is 530505305489. The next prime is 530505305509. The reversal of 530505305500 is 5503505035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530505305509) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3803802 + ... + 3940801.
It is an arithmetic number, because the mean of its divisors is an integer number (24314184258).
Almost surely, 2530505305500 is an apocalyptic number.
530505305500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
530505305500 is an abundant number, since it is smaller than the sum of its proper divisors (636575538884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530505305500 is a wasteful number, since it uses less digits than its factorization.
530505305500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7744759 (or 7744747 counting only the distinct ones).
The product of its (nonzero) digits is 28125, while the sum is 31.
The spelling of 530505305500 in words is "five hundred thirty billion, five hundred five million, three hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •