Base | Representation |
---|---|
bin | 1101100110011… |
… | …1000100010101 |
3 | 10222100012101202 |
4 | 3121213010111 |
5 | 104100422034 |
6 | 5354402245 |
7 | 1261606511 |
oct | 331470425 |
9 | 128305352 |
10 | 57045269 |
11 | 2a222a56 |
12 | 17130385 |
13 | ba840c8 |
14 | 780d141 |
15 | 501c47e |
hex | 3667115 |
57045269 has 2 divisors, whose sum is σ = 57045270. Its totient is φ = 57045268.
The previous prime is 57045223. The next prime is 57045299. The reversal of 57045269 is 96254075.
It is a happy number.
57045269 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., 42315025 + 14730244 = 6505^2 + 3838^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-57045269 is a prime.
It is a super-2 number, since 2×570452692 = 6508325430564722, 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 (57045299) 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, 28522634 + 28522635.
It is an arithmetic number, because the mean of its divisors is an integer number (28522635).
Almost surely, 257045269 is an apocalyptic number.
It is an amenable number.
57045269 is a deficient number, since it is larger than the sum of its proper divisors (1).
57045269 is an equidigital number, since it uses as much as digits as its factorization.
57045269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 38.
The square root of 57045269 is about 7552.8318530204. The cubic root of 57045269 is about 384.9519679214.
The spelling of 57045269 in words is "fifty-seven million, forty-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •