Base | Representation |
---|---|
bin | 110110000000111011… |
… | …010010010011101001 |
3 | 12112200221201100022102 |
4 | 312000323102103221 |
5 | 1422234341144402 |
6 | 42351013503145 |
7 | 4122143315522 |
oct | 660073222351 |
9 | 175627640272 |
10 | 57997599977 |
11 | 22662151309 |
12 | b2a7341ab5 |
13 | 56139525c5 |
14 | 2b42971849 |
15 | 1796a69102 |
hex | d80ed24e9 |
57997599977 has 2 divisors, whose sum is σ = 57997599978. Its totient is φ = 57997599976.
The previous prime is 57997599973. The next prime is 57997600079. The reversal of 57997599977 is 77999579975.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57951414361 + 46185616 = 240731^2 + 6796^2 .
It is a cyclic number.
It is not a de Polignac number, because 57997599977 - 22 = 57997599973 is a prime.
It is a super-3 number, since 3×579975999773 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 57997599895 and 57997599904.
It is not a weakly prime, because it can be changed into another prime (57997599973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28998799988 + 28998799989.
It is an arithmetic number, because the mean of its divisors is an integer number (28998799989).
Almost surely, 257997599977 is an apocalyptic number.
It is an amenable number.
57997599977 is a deficient number, since it is larger than the sum of its proper divisors (1).
57997599977 is an equidigital number, since it uses as much as digits as its factorization.
57997599977 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3544416225, while the sum is 83.
The spelling of 57997599977 in words is "fifty-seven billion, nine hundred ninety-seven million, five hundred ninety-nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •