Base | Representation |
---|---|
bin | 1101110100010… |
… | …0011100110001 |
3 | 11001001021021012 |
4 | 3131010130301 |
5 | 104313431144 |
6 | 5430040305 |
7 | 1302404261 |
oct | 335043461 |
9 | 131037235 |
10 | 57952049 |
11 | 2a792261 |
12 | 174a9095 |
13 | c010a6c |
14 | 79a77a1 |
15 | 514ae9e |
hex | 3744731 |
57952049 has 2 divisors, whose sum is σ = 57952050. Its totient is φ = 57952048.
The previous prime is 57952043. The next prime is 57952057. The reversal of 57952049 is 94025975.
57952049 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., 56731024 + 1221025 = 7532^2 + 1105^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-57952049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 57951997 and 57952015.
It is not a weakly prime, because it can be changed into another prime (57952043) 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, 28976024 + 28976025.
It is an arithmetic number, because the mean of its divisors is an integer number (28976025).
Almost surely, 257952049 is an apocalyptic number.
It is an amenable number.
57952049 is a deficient number, since it is larger than the sum of its proper divisors (1).
57952049 is an equidigital number, since it uses as much as digits as its factorization.
57952049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 41.
The square root of 57952049 is about 7612.6243175399. The cubic root of 57952049 is about 386.9809608556.
The spelling of 57952049 in words is "fifty-seven million, nine hundred fifty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •