Base | Representation |
---|---|
bin | 1101100101110… |
… | …0001000010101 |
3 | 10222020220221111 |
4 | 3121130020111 |
5 | 104043003334 |
6 | 5353415021 |
7 | 1261332061 |
oct | 331341025 |
9 | 128226844 |
10 | 57000469 |
11 | 2a1a2329 |
12 | 1710a471 |
13 | ba698b6 |
14 | 77daaa1 |
15 | 500e064 |
hex | 365c215 |
57000469 has 2 divisors, whose sum is σ = 57000470. Its totient is φ = 57000468.
The previous prime is 57000467. The next prime is 57000479. The reversal of 57000469 is 96400075.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49914225 + 7086244 = 7065^2 + 2662^2 .
It is a cyclic number.
It is not a de Polignac number, because 57000469 - 21 = 57000467 is a prime.
It is a super-2 number, since 2×570004692 = 6498106932439922, which contains 22 as substring.
Together with 57000467, it forms a pair of twin primes.
It is equal to p3394462 and since 57000469 and 3394462 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 57000469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57000467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28500234 + 28500235.
It is an arithmetic number, because the mean of its divisors is an integer number (28500235).
Almost surely, 257000469 is an apocalyptic number.
It is an amenable number.
57000469 is a deficient number, since it is larger than the sum of its proper divisors (1).
57000469 is an equidigital number, since it uses as much as digits as its factorization.
57000469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 57000469 is about 7549.8654954906. The cubic root of 57000469 is about 384.8511686494.
The spelling of 57000469 in words is "fifty-seven million, four hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •