The number 57961
57961 is a composite number with 4 divisors. Its prime factorisation is 149 × 389. Divisors (4): 1, 149, 389, 57961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57961: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 149 × 389, the product of two primes.
- 2
57961 is composite. Its prime factorisation is
- 3
The divisors add up to 58500; without 57961 itself that is 539, so 57961 is deficient (539 is less than 57961). Euler's totient φ(57961) = 57424 numbers up to 57961 share no factor with it.
- 4
The digits of 57961 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57961 = 149 \times 389 \]
57961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58500 |
| Euler totient φ(n) | 57424 |
| Square | 3359477521 |
| Cube | 194718676594681 |
| Square root | 240.750909 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.7961 × |
57961 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and sixty-one |
| Binary (base 2) | 1110001001101001 |
| Octal (base 8) | 161151 |
| Hexadecimal (base 16) | E269 |
| Base 3 | 2221111201 |
| As time | 57961 seconds = 16 h 6 min 1 s |
Is 57961 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57961 a prime number?
No. 57961 = 149 × 389, so it is divisible by 149.
What are the factors of 57961?
1, 149, 389, 57961.
What is 57961 in binary?
1110001001101001 (hexadecimal E269, octal 161151).
What is the square root of 57961?
About 240.7509.
Is 57961 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 57961?
57961 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 149 × 389, the product of two primes.