Base | Representation |
---|---|
bin | 11111110000001… |
… | …011110110001000 |
3 | 1101010102020111022 |
4 | 133300023312020 |
5 | 2042334201003 |
6 | 124510052012 |
7 | 16126042325 |
oct | 3760136610 |
9 | 1333366438 |
10 | 532725128 |
11 | 253789301 |
12 | 12a4aa008 |
13 | 864a2590 |
14 | 50a73b4c |
15 | 31b7e738 |
hex | 1fc0bd88 |
532725128 has 64 divisors (see below), whose sum is σ = 1120316400. Its totient is φ = 235791360.
The previous prime is 532725121. The next prime is 532725133. The reversal of 532725128 is 821527235.
It can be written as a sum of positive squares in 8 ways, for example, as 318336964 + 214388164 = 17842^2 + 14642^2 .
It is not an unprimeable number, because it can be changed into a prime (532725121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 521258 + ... + 522278.
Almost surely, 2532725128 is an apocalyptic number.
532725128 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 532725128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (560158200).
532725128 is an abundant number, since it is smaller than the sum of its proper divisors (587591272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
532725128 is a wasteful number, since it uses less digits than its factorization.
532725128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242 (or 1238 counting only the distinct ones).
The product of its digits is 33600, while the sum is 35.
The square root of 532725128 is about 23080.8389795518. The cubic root of 532725128 is about 810.6518798460.
The spelling of 532725128 in words is "five hundred thirty-two million, seven hundred twenty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •