The number 57951
57951 is a composite number with 12 divisors. Its prime factorisation is × 47 × 137. Divisors (12): 1, 3, 9, 47, 137, 141, 411, 423, 1233, 6439, 19317, 57951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57951 is composite. Its prime factorisation is
- 3
The divisors add up to 86112; without 57951 itself that is 28161, so 57951 is deficient (28161 is less than 57951). Euler's totient φ(57951) = 37536 numbers up to 57951 share no factor with it.
- 4
The digits of 57951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57951 = 3^{2} \times 47 \times 137 \]57951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86112 |
| Euler totient φ(n) | 37536 |
| Square | 3358318401 |
| Cube | 194617909656351 |
| Square root | 240.730139 (= 3√6439) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.7951 × |
57951 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and fifty-one |
| Binary (base 2) | 1110001001011111 |
| Octal (base 8) | 161137 |
| Hexadecimal (base 16) | E25F |
| Base 3 | 2221111100 |
| As time | 57951 seconds = 16 h 5 min 51 s |
Is 57951 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 | Yes (57951 ÷ 3 = 19317) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (57951 ÷ 9 = 6439) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57951 a prime number?
No. 57951 = × 47 × 137, so it is divisible by 3.
What are the factors of 57951?
1, 3, 9, 47, 137, 141, 411, 423, 1233, 6439, 19317, 57951.
What is 57951 in binary?
1110001001011111 (hexadecimal E25F, octal 161137).
What is the square root of 57951?
About 240.7301, exactly 3√6439.
Is 57951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 57951?
It is a composite number with 12 divisors.