Base | Representation |
---|---|
bin | 1101100110110… |
… | …0110010000101 |
3 | 10222101101111201 |
4 | 3121230302011 |
5 | 104102144202 |
6 | 5355102501 |
7 | 1262034661 |
oct | 331546205 |
9 | 128341451 |
10 | 57068677 |
11 | 2a2395a6 |
12 | 17141a31 |
13 | ba91963 |
14 | 78178a1 |
15 | 5024387 |
hex | 366cc85 |
57068677 has 4 divisors (see below), whose sum is σ = 60425676. Its totient is φ = 53711680.
The previous prime is 57068653. The next prime is 57068707. The reversal of 57068677 is 77686075.
57068677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 45819361 + 11249316 = 6769^2 + 3354^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-57068677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57068617) 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 3 ways as a sum of consecutive naturals, for example, 1678474 + ... + 1678507.
It is an arithmetic number, because the mean of its divisors is an integer number (15106419).
Almost surely, 257068677 is an apocalyptic number.
It is an amenable number.
57068677 is a deficient number, since it is larger than the sum of its proper divisors (3356999).
57068677 is a wasteful number, since it uses less digits than its factorization.
57068677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3356998.
The product of its (nonzero) digits is 493920, while the sum is 46.
The square root of 57068677 is about 7554.3813115304. The cubic root of 57068677 is about 385.0046145509.
The spelling of 57068677 in words is "fifty-seven million, sixty-eight thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •