Base | Representation |
---|---|
bin | 1101100110000… |
… | …0101110010101 |
3 | 10222021212202101 |
4 | 3121200232111 |
5 | 104044104120 |
6 | 5354042101 |
7 | 1261440661 |
oct | 331405625 |
9 | 128255671 |
10 | 57019285 |
11 | 2a205484 |
12 | 17119331 |
13 | ba7532b |
14 | 78038a1 |
15 | 501490a |
hex | 3660b95 |
57019285 has 8 divisors (see below), whose sum is σ = 72024480. Its totient is φ = 43214544.
The previous prime is 57019283. The next prime is 57019297. The reversal of 57019285 is 58291075.
57019285 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 57019285 - 21 = 57019283 is a prime.
It is a super-2 number, since 2×570192852 = 6502397723822450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57019283) 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 in 7 ways as a sum of consecutive naturals, for example, 300007 + ... + 300196.
It is an arithmetic number, because the mean of its divisors is an integer number (9003060).
Almost surely, 257019285 is an apocalyptic number.
It is an amenable number.
57019285 is a deficient number, since it is larger than the sum of its proper divisors (15005195).
57019285 is a wasteful number, since it uses less digits than its factorization.
57019285 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600227.
The product of its (nonzero) digits is 25200, while the sum is 37.
The square root of 57019285 is about 7551.1115075862. Note that the first 3 decimals coincide. The cubic root of 57019285 is about 384.8935107743.
The spelling of 57019285 in words is "fifty-seven million, nineteen thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •