Base | Representation |
---|---|
bin | 110101001000111000… |
… | …001111010010000101 |
3 | 12110021102022222202202 |
4 | 311020320033102011 |
5 | 1413323130331221 |
6 | 42113423244245 |
7 | 4056634565351 |
oct | 651070172205 |
9 | 173242288682 |
10 | 57057277061 |
11 | 2221a388834 |
12 | b084449685 |
13 | 54c3bab405 |
14 | 2a93b1a461 |
15 | 173e224d0b |
hex | d48e0f485 |
57057277061 has 4 divisors (see below), whose sum is σ = 57101750112. Its totient is φ = 57012804012.
The previous prime is 57057277049. The next prime is 57057277073. The reversal of 57057277061 is 16077275075.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (57057277049) and next prime (57057277073).
It is a cyclic number.
It is not a de Polignac number, because 57057277061 - 210 = 57057276037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 57057276997 and 57057277015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57057277861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22234601 + ... + 22237166.
It is an arithmetic number, because the mean of its divisors is an integer number (14275437528).
Almost surely, 257057277061 is an apocalyptic number.
It is an amenable number.
57057277061 is a deficient number, since it is larger than the sum of its proper divisors (44473051).
57057277061 is a wasteful number, since it uses less digits than its factorization.
57057277061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44473050.
The product of its (nonzero) digits is 720300, while the sum is 47.
The spelling of 57057277061 in words is "fifty-seven billion, fifty-seven million, two hundred seventy-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •