Base | Representation |
---|---|
bin | 1111011011001101010… |
… | …01000111101011111110 |
3 | 1212200000211012200212200 |
4 | 13231212221013223332 |
5 | 32140421234022310 |
6 | 1043251404212330 |
7 | 53201653306305 |
oct | 7554651075376 |
9 | 1780024180780 |
10 | 530003032830 |
11 | 1948559930a7 |
12 | 86874b3a0a6 |
13 | 3ac9603543b |
14 | 1b91bc1b43c |
15 | dbbeb5a9c0 |
hex | 7b66a47afe |
530003032830 has 48 divisors (see below), whose sum is σ = 1459067176944. Its totient is φ = 133020368640.
The previous prime is 530003032817. The next prime is 530003032843. The reversal of 530003032830 is 38230300035.
It is a happy number.
530003032830 is a `hidden beast` number, since 5 + 300 + 0 + 3 + 0 + 328 + 30 = 666.
It is an interprime number because it is at equal distance from previous prime (530003032817) and next prime (530003032843).
It is a junction number, because it is equal to n+sod(n) for n = 530003032794 and 530003032803.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 173202076 + ... + 173205135.
It is an arithmetic number, because the mean of its divisors is an integer number (30397232853).
Almost surely, 2530003032830 is an apocalyptic number.
530003032830 is an abundant number, since it is smaller than the sum of its proper divisors (929064144114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530003032830 is a wasteful number, since it uses less digits than its factorization.
530003032830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346407241 (or 346407238 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 530003032830 its reverse (38230300035), we get a palindrome (568233332865).
The spelling of 530003032830 in words is "five hundred thirty billion, three million, thirty-two thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •