Base | Representation |
---|---|
bin | 1100100001001… |
… | …0101110011101 |
3 | 10122210120000012 |
4 | 3020102232131 |
5 | 101420134001 |
6 | 5113213005 |
7 | 1205201156 |
oct | 310225635 |
9 | 118716005 |
10 | 52505501 |
11 | 27702184 |
12 | 15701165 |
13 | ab54959 |
14 | 6d8a92d |
15 | 49222bb |
hex | 3212b9d |
52505501 has 2 divisors, whose sum is σ = 52505502. Its totient is φ = 52505500.
The previous prime is 52505491. The next prime is 52505507. The reversal of 52505501 is 10550525.
52505501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49716601 + 2788900 = 7051^2 + 1670^2 .
It is a cyclic number.
It is not a de Polignac number, because 52505501 - 218 = 52243357 is a prime.
It is a super-2 number, since 2×525055012 = 5513655270522002, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52505507) 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, 26252750 + 26252751.
It is an arithmetic number, because the mean of its divisors is an integer number (26252751).
Almost surely, 252505501 is an apocalyptic number.
It is an amenable number.
52505501 is a deficient number, since it is larger than the sum of its proper divisors (1).
52505501 is an equidigital number, since it uses as much as digits as its factorization.
52505501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1250, while the sum is 23.
The square root of 52505501 is about 7246.0679682156. The cubic root of 52505501 is about 374.4566970905.
The spelling of 52505501 in words is "fifty-two million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •