Base | Representation |
---|---|
bin | 1101110000100… |
… | …1000101000101 |
3 | 11000120220200112 |
4 | 3130021011011 |
5 | 104233140434 |
6 | 5420522405 |
7 | 1300342301 |
oct | 334110505 |
9 | 130526615 |
10 | 57708869 |
11 | 2a636589 |
12 | 173b0405 |
13 | bc5717a |
14 | 7942d01 |
15 | 50eddce |
hex | 3709145 |
57708869 has 4 divisors (see below), whose sum is σ = 59698860. Its totient is φ = 55718880.
The previous prime is 57708841. The next prime is 57708877. The reversal of 57708869 is 96880775.
It is a happy number.
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 37368769 + 20340100 = 6113^2 + 4510^2 .
It is a cyclic number.
It is not a de Polignac number, because 57708869 - 28 = 57708613 is a prime.
It is a super-2 number, since 2×577088692 = 6660627122518322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57708169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 994952 + ... + 995009.
It is an arithmetic number, because the mean of its divisors is an integer number (14924715).
Almost surely, 257708869 is an apocalyptic number.
It is an amenable number.
57708869 is a deficient number, since it is larger than the sum of its proper divisors (1989991).
57708869 is a wasteful number, since it uses less digits than its factorization.
57708869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989990.
The product of its (nonzero) digits is 846720, while the sum is 50.
The square root of 57708869 is about 7596.6353736375. The cubic root of 57708869 is about 386.4389152074.
The spelling of 57708869 in words is "fifty-seven million, seven hundred eight thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •