Base | Representation |
---|---|
bin | 1100011010011… |
… | …1001110000101 |
3 | 10121222011222011 |
4 | 3012213032011 |
5 | 101312041112 |
6 | 5055534221 |
7 | 1201355314 |
oct | 306471605 |
9 | 117864864 |
10 | 52065157 |
11 | 27431361 |
12 | 1552a371 |
13 | aa2c3b1 |
14 | 6cb427b |
15 | 4886aa7 |
hex | 31a7385 |
52065157 has 2 divisors, whose sum is σ = 52065158. Its totient is φ = 52065156.
The previous prime is 52065137. The next prime is 52065191. The reversal of 52065157 is 75156025.
52065157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 44742721 + 7322436 = 6689^2 + 2706^2 .
It is a cyclic number.
It is not a de Polignac number, because 52065157 - 219 = 51540869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52065107) 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 as a sum of consecutive naturals, namely, 26032578 + 26032579.
It is an arithmetic number, because the mean of its divisors is an integer number (26032579).
Almost surely, 252065157 is an apocalyptic number.
It is an amenable number.
52065157 is a deficient number, since it is larger than the sum of its proper divisors (1).
52065157 is an equidigital number, since it uses as much as digits as its factorization.
52065157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 52065157 is about 7215.6189616692. The cubic root of 52065157 is about 373.4069475550.
The spelling of 52065157 in words is "fifty-two million, sixty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •