Base | Representation |
---|---|
bin | 11111100000000… |
… | …010111000110010 |
3 | 1100211110021122200 |
4 | 133200002320302 |
5 | 2040243303010 |
6 | 124235244030 |
7 | 16045061133 |
oct | 3740027062 |
9 | 1324407580 |
10 | 528494130 |
11 | 25135950a |
12 | 128ba9616 |
13 | 85650828 |
14 | 50291c8a |
15 | 315e5cc0 |
hex | 1f802e32 |
528494130 has 96 divisors (see below), whose sum is σ = 1468724400. Its totient is φ = 131383296.
The previous prime is 528494119. The next prime is 528494137. The reversal of 528494130 is 31494825.
It can be written as a sum of positive squares in 8 ways, for example, as 436851801 + 91642329 = 20901^2 + 9573^2 .
It is not an unprimeable number, because it can be changed into a prime (528494137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 165186 + ... + 168354.
Almost surely, 2528494130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 528494130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (734362200).
528494130 is an abundant number, since it is smaller than the sum of its proper divisors (940230270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
528494130 is a wasteful number, since it uses less digits than its factorization.
528494130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3308 (or 3305 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 528494130 is about 22989.0001957458. Note that the first 3 decimals coincide. The cubic root of 528494130 is about 808.5000590892.
The spelling of 528494130 in words is "five hundred twenty-eight million, four hundred ninety-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •