Base | Representation |
---|---|
bin | 1100011100100… |
… | …1011110001001 |
3 | 10122020022102011 |
4 | 3013021132021 |
5 | 101331033244 |
6 | 5102535521 |
7 | 1202511322 |
oct | 307113611 |
9 | 118208364 |
10 | 52205449 |
11 | 275177aa |
12 | 155975a1 |
13 | aa7b1ca |
14 | 6d0d449 |
15 | 48b3434 |
hex | 31c9789 |
52205449 has 2 divisors, whose sum is σ = 52205450. Its totient is φ = 52205448.
The previous prime is 52205443. The next prime is 52205467. The reversal of 52205449 is 94450225.
52205449 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., 30415225 + 21790224 = 5515^2 + 4668^2 .
It is a cyclic number.
It is not a de Polignac number, because 52205449 - 29 = 52204937 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52205449.
It is not a weakly prime, because it can be changed into another prime (52205443) 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, 26102724 + 26102725.
It is an arithmetic number, because the mean of its divisors is an integer number (26102725).
Almost surely, 252205449 is an apocalyptic number.
It is an amenable number.
52205449 is a deficient number, since it is larger than the sum of its proper divisors (1).
52205449 is an equidigital number, since it uses as much as digits as its factorization.
52205449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 52205449 is about 7225.3338331180. Note that the first 3 decimals coincide. The cubic root of 52205449 is about 373.7420342594.
The spelling of 52205449 in words is "fifty-two million, two hundred five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •