Base | Representation |
---|---|
bin | 11111101000100… |
… | …110011000000000 |
3 | 1100222200012210121 |
4 | 133220212120000 |
5 | 2041332033030 |
6 | 124355310024 |
7 | 16103121100 |
oct | 3750463000 |
9 | 1328605717 |
10 | 530736640 |
11 | 252650325 |
12 | 1298ab314 |
13 | 85c57465 |
14 | 506b7200 |
15 | 318da47a |
hex | 1fa26600 |
530736640 has 120 divisors (see below), whose sum is σ = 1480632912. Its totient is φ = 181923840.
The previous prime is 530736631. The next prime is 530736641. The reversal of 530736640 is 46637035.
530736640 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 530736596 and 530736605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530736641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 123325 + ... + 127555.
Almost surely, 2530736640 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 530736640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (740316456).
530736640 is an abundant number, since it is smaller than the sum of its proper divisors (949896272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530736640 is an equidigital number, since it uses as much as digits as its factorization.
530736640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4268 (or 4245 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 34.
The square root of 530736640 is about 23037.7221096184. The cubic root of 530736640 is about 809.6419898337.
The spelling of 530736640 in words is "five hundred thirty million, seven hundred thirty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •