Base | Representation |
---|---|
bin | 1100011011001… |
… | …1100010101001 |
3 | 10122001202012100 |
4 | 3012303202221 |
5 | 101320200000 |
6 | 5101004013 |
7 | 1201655412 |
oct | 306634251 |
9 | 118052170 |
10 | 52115625 |
11 | 27466271 |
12 | 15553609 |
13 | aa49363 |
14 | 6cc8809 |
15 | 4896a00 |
hex | 31b38a9 |
52115625 has 72 divisors (see below), whose sum is σ = 100540440. Its totient is φ = 25920000.
The previous prime is 52115603. The next prime is 52115629. The reversal of 52115625 is 52651125.
52115625 is a `hidden beast` number, since 5 + 21 + 15 + 625 = 666.
52115625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 47941776 + 4173849 = 6924^2 + 2043^2 .
It is not a de Polignac number, because 52115625 - 26 = 52115561 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (52115629) 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 71 ways as a sum of consecutive naturals, for example, 478071 + ... + 478179.
It is an arithmetic number, because the mean of its divisors is an integer number (1396395).
Almost surely, 252115625 is an apocalyptic number.
It is an amenable number.
52115625 is a deficient number, since it is larger than the sum of its proper divisors (48424815).
52115625 is a wasteful number, since it uses less digits than its factorization.
52115625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157 (or 134 counting only the distinct ones).
The product of its digits is 3000, while the sum is 27.
The square root of 52115625 is about 7219.1152504999. The cubic root of 52115625 is about 373.5275593499.
The spelling of 52115625 in words is "fifty-two million, one hundred fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •