Base | Representation |
---|---|
bin | 110101101000001110… |
… | …001000111111001101 |
3 | 12111122001210011220002 |
4 | 311220032020333031 |
5 | 1420412234042031 |
6 | 42241525534045 |
7 | 4105651243262 |
oct | 655016107715 |
9 | 174561704802 |
10 | 57583112141 |
11 | 2246a190485 |
12 | b1b0574325 |
13 | 5578b0a829 |
14 | 2b038b9269 |
15 | 1770492ccb |
hex | d68388fcd |
57583112141 has 4 divisors (see below), whose sum is σ = 57622744092. Its totient is φ = 57543480192.
The previous prime is 57583112137. The next prime is 57583112143. The reversal of 57583112141 is 14121138575.
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 47940854116 + 9642258025 = 218954^2 + 98195^2 .
It is a cyclic number.
It is not a de Polignac number, because 57583112141 - 22 = 57583112137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57583112095 and 57583112104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57583112143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19813796 + ... + 19816701.
It is an arithmetic number, because the mean of its divisors is an integer number (14405686023).
Almost surely, 257583112141 is an apocalyptic number.
It is an amenable number.
57583112141 is a deficient number, since it is larger than the sum of its proper divisors (39631951).
57583112141 is a wasteful number, since it uses less digits than its factorization.
57583112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39631950.
The product of its digits is 33600, while the sum is 38.
The spelling of 57583112141 in words is "fifty-seven billion, five hundred eighty-three million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •