Base | Representation |
---|---|
bin | 1100100001100… |
… | …1010100110100 |
3 | 10122211221002100 |
4 | 3020121110310 |
5 | 101422020112 |
6 | 5113542100 |
7 | 1205343033 |
oct | 310312464 |
9 | 118757070 |
10 | 52532532 |
11 | 27720518 |
12 | 15714930 |
13 | ab64050 |
14 | 6d9671a |
15 | 492a2dc |
hex | 3219534 |
52532532 has 36 divisors (see below), whose sum is σ = 143006500. Its totient is φ = 16163712.
The previous prime is 52532471. The next prime is 52532539. The reversal of 52532532 is 23523525.
It can be written as a sum of positive squares in 2 ways, for example, as 29550096 + 22982436 = 5436^2 + 4794^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 52532496 and 52532505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52532539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55657 + ... + 56592.
Almost surely, 252532532 is an apocalyptic number.
52532532 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
52532532 is an abundant number, since it is smaller than the sum of its proper divisors (90473968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52532532 is a wasteful number, since it uses less digits than its factorization.
52532532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112272 (or 112267 counting only the distinct ones).
The product of its digits is 9000, while the sum is 27.
The square root of 52532532 is about 7247.9329467097. The cubic root of 52532532 is about 374.5209456123.
The spelling of 52532532 in words is "fifty-two million, five hundred thirty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •