The number 57959
57959 is a composite number with 6 divisors. Its prime factorisation is Ć 479. Divisors (6): 1, 11, 121, 479, 5269, 57959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57959 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57959 is composite. Its prime factorisation is
- 3
The divisors add up to 63840; without 57959 itself that is 5881, so 57959 is deficient (5881 is less than 57959). Euler's totient Ļ(57959) = 52580 numbers up to 57959 share no factor with it.
- 4
The digits of 57959 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57959 = 11^{2} \times 479 \]57959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 63840 |
| Euler totient Ļ(n) | 52580 |
| Square | 3359245681 |
| Cube | 194698520425079 |
| Square root | 240.746755 (= 11ā479) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.7959 Ć |
57959 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and fifty-nine |
| Binary (base 2) | 1110001001100111 |
| Octal (base 8) | 161147 |
| Hexadecimal (base 16) | E267 |
| Base 3 | 2221111122 |
| As time | 57959 seconds = 16 h 5 min 59 s |
Is 57959 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (57959 Ć· 11 = 5269) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57959 a prime number?
No. 57959 = Ć 479, so it is divisible by 11.
What are the factors of 57959?
1, 11, 121, 479, 5269, 57959.
What is 57959 in binary?
1110001001100111 (hexadecimal E267, octal 161147).
What is the square root of 57959?
About 240.7468, exactly 11ā479.
Is 57959 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 57959?
It is a composite number with 6 divisors.