Base | Representation |
---|---|
bin | 1111011011110100010… |
… | …10010110101111011110 |
3 | 1212200212122102101022210 |
4 | 13231322022112233132 |
5 | 32142104102343400 |
6 | 1043344103221250 |
7 | 53213040656142 |
oct | 7557212265736 |
9 | 1780778371283 |
10 | 530330512350 |
11 | 194a03826331 |
12 | 86946747826 |
13 | 3b018b34bc2 |
14 | 1b94d505222 |
15 | dbdd796950 |
hex | 7b7a296bde |
530330512350 has 48 divisors (see below), whose sum is σ = 1316948232240. Its totient is φ = 141235603200.
The previous prime is 530330512337. The next prime is 530330512379. The reversal of 530330512350 is 53215033035.
530330512350 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 2208805 + ... + 2437104.
It is an arithmetic number, because the mean of its divisors is an integer number (27436421505).
Almost surely, 2530330512350 is an apocalyptic number.
530330512350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
530330512350 is an abundant number, since it is smaller than the sum of its proper divisors (786617719890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530330512350 is a wasteful number, since it uses less digits than its factorization.
530330512350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4646685 (or 4646680 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 30.
Adding to 530330512350 its reverse (53215033035), we get a palindrome (583545545385).
The spelling of 530330512350 in words is "five hundred thirty billion, three hundred thirty million, five hundred twelve thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •