Base | Representation |
---|---|
bin | 1101101100010… |
… | …1110100000101 |
3 | 11000001220202002 |
4 | 3123011310011 |
5 | 104200331344 |
6 | 5410555045 |
7 | 1265114111 |
oct | 333056405 |
9 | 130056662 |
10 | 57433349 |
11 | 2a468586 |
12 | 17298a85 |
13 | bb8b93c |
14 | 78b0741 |
15 | 509744e |
hex | 36c5d05 |
57433349 has 2 divisors, whose sum is σ = 57433350. Its totient is φ = 57433348.
The previous prime is 57433339. The next prime is 57433351. The reversal of 57433349 is 94333475.
57433349 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., 52562500 + 4870849 = 7250^2 + 2207^2 .
It is a cyclic number.
It is not a de Polignac number, because 57433349 - 216 = 57367813 is a prime.
It is a Sophie Germain prime.
Together with 57433351, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57433339) 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, 28716674 + 28716675.
It is an arithmetic number, because the mean of its divisors is an integer number (28716675).
Almost surely, 257433349 is an apocalyptic number.
It is an amenable number.
57433349 is a deficient number, since it is larger than the sum of its proper divisors (1).
57433349 is an equidigital number, since it uses as much as digits as its factorization.
57433349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 136080, while the sum is 38.
The square root of 57433349 is about 7578.4793329533. The cubic root of 57433349 is about 385.8229408895.
The spelling of 57433349 in words is "fifty-seven million, four hundred thirty-three thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •