Base | Representation |
---|---|
bin | 11111100110010… |
… | …001111101100100 |
3 | 1100221112022220210 |
4 | 133212101331210 |
5 | 2041203104430 |
6 | 124334255420 |
7 | 16065006561 |
oct | 3746217544 |
9 | 1327468823 |
10 | 530128740 |
11 | 252275629 |
12 | 129657570 |
13 | 85aa385b |
14 | 50599868 |
15 | 3181a2b0 |
hex | 1f991f64 |
530128740 has 48 divisors (see below), whose sum is σ = 1486058112. Its totient is φ = 141206016.
The previous prime is 530128717. The next prime is 530128741. The reversal of 530128740 is 47821035.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 530128698 and 530128707.
It is not an unprimeable number, because it can be changed into a prime (530128741) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 53452 + ... + 62588.
It is an arithmetic number, because the mean of its divisors is an integer number (30959544).
Almost surely, 2530128740 is an apocalyptic number.
It is an amenable number.
530128740 is an abundant number, since it is smaller than the sum of its proper divisors (955929372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530128740 is a wasteful number, since it uses less digits than its factorization.
530128740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10116 (or 10114 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 530128740 is about 23024.5247507956. The cubic root of 530128740 is about 809.3327533491.
Adding to 530128740 its reverse (47821035), we get a palindrome (577949775).
The spelling of 530128740 in words is "five hundred thirty million, one hundred twenty-eight thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •