Base | Representation |
---|---|
bin | 11111101000000… |
… | …011010000000000 |
3 | 1100222101220110000 |
4 | 133220003100000 |
5 | 2041312432033 |
6 | 124352240000 |
7 | 16101651456 |
oct | 3750032000 |
9 | 1328356400 |
10 | 530592768 |
11 | 252562222 |
12 | 129840000 |
13 | 85c06b24 |
14 | 5067a9d6 |
15 | 318aca13 |
hex | 1fa03400 |
530592768 has 110 divisors (see below), whose sum is σ = 1584701426. Its totient is φ = 176836608.
The previous prime is 530592761. The next prime is 530592779. The reversal of 530592768 is 867295035.
It is a happy number.
530592768 is a `hidden beast` number, since 53 + 0 + 592 + 7 + 6 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 288728064 + 241864704 = 16992^2 + 15552^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530592761) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 79746 + ... + 86142.
Almost surely, 2530592768 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 530592768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (792350713).
530592768 is an abundant number, since it is smaller than the sum of its proper divisors (1054108658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530592768 is an equidigital number, since it uses as much as digits as its factorization.
530592768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6429 (or 6402 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The square root of 530592768 is about 23034.5993670391. The cubic root of 530592768 is about 809.5688240168.
The spelling of 530592768 in words is "five hundred thirty million, five hundred ninety-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •