Base | Representation |
---|---|
bin | 1101101101000… |
… | …0111000001101 |
3 | 11000011012220121 |
4 | 3123100320031 |
5 | 104203304134 |
6 | 5411544541 |
7 | 1265363203 |
oct | 333207015 |
9 | 130135817 |
10 | 57478669 |
11 | 2a499636 |
12 | 172bb151 |
13 | bba6461 |
14 | 78c3073 |
15 | 50a5ab4 |
hex | 36d0e0d |
57478669 has 2 divisors, whose sum is σ = 57478670. Its totient is φ = 57478668.
The previous prime is 57478661. The next prime is 57478699. The reversal of 57478669 is 96687475.
It is a happy number.
57478669 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., 41757444 + 15721225 = 6462^2 + 3965^2 .
It is a cyclic number.
It is not a de Polignac number, because 57478669 - 23 = 57478661 is a prime.
It is a super-2 number, since 2×574786692 = 6607594780023122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57478661) 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, 28739334 + 28739335.
It is an arithmetic number, because the mean of its divisors is an integer number (28739335).
Almost surely, 257478669 is an apocalyptic number.
It is an amenable number.
57478669 is a deficient number, since it is larger than the sum of its proper divisors (1).
57478669 is an equidigital number, since it uses as much as digits as its factorization.
57478669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2540160, while the sum is 52.
The square root of 57478669 is about 7581.4687890936. The cubic root of 57478669 is about 385.9243970342.
The spelling of 57478669 in words is "fifty-seven million, four hundred seventy-eight thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •