Base | Representation |
---|---|
bin | 1101100110011… |
… | …1101000010001 |
3 | 10222100022112221 |
4 | 3121213220101 |
5 | 104101010234 |
6 | 5354421041 |
7 | 1261616305 |
oct | 331475021 |
9 | 128308487 |
10 | 57047569 |
11 | 2a224757 |
12 | 17131781 |
13 | ba85177 |
14 | 780dd05 |
15 | 501ceb4 |
hex | 3667a11 |
57047569 has 2 divisors, whose sum is σ = 57047570. Its totient is φ = 57047568.
The previous prime is 57047561. The next prime is 57047587. The reversal of 57047569 is 96574075.
57047569 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., 31494544 + 25553025 = 5612^2 + 5055^2 .
It is a cyclic number.
It is not a de Polignac number, because 57047569 - 23 = 57047561 is a prime.
It is a super-2 number, since 2×570475692 = 6508850257619522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (57047561) 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, 28523784 + 28523785.
It is an arithmetic number, because the mean of its divisors is an integer number (28523785).
Almost surely, 257047569 is an apocalyptic number.
It is an amenable number.
57047569 is a deficient number, since it is larger than the sum of its proper divisors (1).
57047569 is an equidigital number, since it uses as much as digits as its factorization.
57047569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 264600, while the sum is 43.
The square root of 57047569 is about 7552.9841122566. The cubic root of 57047569 is about 384.9571414595.
The spelling of 57047569 in words is "fifty-seven million, forty-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •