Base | Representation |
---|---|
bin | 1100100011001… |
… | …1011110010000 |
3 | 10200001101000000 |
4 | 3020303132100 |
5 | 101433432012 |
6 | 5120130000 |
7 | 1206300213 |
oct | 310633620 |
9 | 120041000 |
10 | 52639632 |
11 | 27793a31 |
12 | 15766900 |
13 | aba0a16 |
14 | 6dc377a |
15 | 494bddc |
hex | 3233790 |
52639632 has 70 divisors (see below), whose sum is σ = 152947862. Its totient is φ = 17542656.
The previous prime is 52639627. The next prime is 52639637. The reversal of 52639632 is 23693625.
It is an interprime number because it is at equal distance from previous prime (52639627) and next prime (52639637).
It can be written as a sum of positive squares in only one way, i.e., 26873856 + 25765776 = 5184^2 + 5076^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (52639637) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 9408 + ... + 13920.
Almost surely, 252639632 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 52639632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76473931).
52639632 is an abundant number, since it is smaller than the sum of its proper divisors (100308230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52639632 is an equidigital number, since it uses as much as digits as its factorization.
52639632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4539 (or 4518 counting only the distinct ones).
The product of its digits is 58320, while the sum is 36.
The square root of 52639632 is about 7255.3174982216. The cubic root of 52639632 is about 374.7752893739.
The spelling of 52639632 in words is "fifty-two million, six hundred thirty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •