Base | Representation |
---|---|
bin | 1100100011001… |
… | …0110001010000 |
3 | 10200001020001100 |
4 | 3020302301100 |
5 | 101433334002 |
6 | 5120104400 |
7 | 1206255630 |
oct | 310626120 |
9 | 120036040 |
10 | 52636752 |
11 | 27791853 |
12 | 15765100 |
13 | ab9c60c |
14 | 6dc26c0 |
15 | 494b11c |
hex | 3232c50 |
52636752 has 120 divisors (see below), whose sum is σ = 170743040. Its totient is φ = 14826240.
The previous prime is 52636751. The next prime is 52636781. The reversal of 52636752 is 25763625.
It is a happy number.
It is a super-2 number, since 2×526367522 = 5541255322219008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52636751) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 79302 + ... + 79962.
Almost surely, 252636752 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 52636752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85371520).
52636752 is an abundant number, since it is smaller than the sum of its proper divisors (118106288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52636752 is a wasteful number, since it uses less digits than its factorization.
52636752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 761 (or 752 counting only the distinct ones).
The product of its digits is 75600, while the sum is 36.
The square root of 52636752 is about 7255.1190203883. The cubic root of 52636752 is about 374.7684543938.
It can be divided in two parts, 52 and 636752, that added together give a square (636804 = 7982).
The spelling of 52636752 in words is "fifty-two million, six hundred thirty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •