Base | Representation |
---|---|
bin | 1100100001100… |
… | …1011001111001 |
3 | 10122211221112101 |
4 | 3020121121321 |
5 | 101422022412 |
6 | 5113543401 |
7 | 1205344006 |
oct | 310313171 |
9 | 118757471 |
10 | 52532857 |
11 | 27720793 |
12 | 15714b61 |
13 | ab64240 |
14 | 6d968ad |
15 | 492a457 |
hex | 3219679 |
52532857 has 4 divisors (see below), whose sum is σ = 56573860. Its totient is φ = 48491856.
The previous prime is 52532819. The next prime is 52532861. The reversal of 52532857 is 75823525.
52532857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15335056 + 37197801 = 3916^2 + 6099^2 .
It is a cyclic number.
It is not a de Polignac number, because 52532857 - 211 = 52530809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52532807) 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 3 ways as a sum of consecutive naturals, for example, 2020482 + ... + 2020507.
It is an arithmetic number, because the mean of its divisors is an integer number (14143465).
Almost surely, 252532857 is an apocalyptic number.
It is an amenable number.
52532857 is a deficient number, since it is larger than the sum of its proper divisors (4041003).
52532857 is a wasteful number, since it uses less digits than its factorization.
52532857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4041002.
The product of its digits is 84000, while the sum is 37.
The square root of 52532857 is about 7247.9553668604. The cubic root of 52532857 is about 374.5217179531.
The spelling of 52532857 in words is "fifty-two million, five hundred thirty-two thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •