The number 57963
57963 is a composite number with 6 divisors. Its prime factorisation is 3 Ć . Divisors (6): 1, 3, 139, 417, 19321, 57963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57963 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57963 is composite. Its prime factorisation is
- 3
The divisors add up to 77844; without 57963 itself that is 19881, so 57963 is deficient (19881 is less than 57963). Euler's totient Ļ(57963) = 38364 numbers up to 57963 share no factor with it.
- 4
The digits of 57963 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57963 = 3 \times 139^{2} \]57963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 77844 |
| Euler totient Ļ(n) | 38364 |
| Square | 3359709369 |
| Cube | 194738834155347 |
| Square root | 240.755062 (= 139ā3) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.7963 Ć |
57963 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand nine hundred and sixty-three |
| Binary (base 2) | 1110001001101011 |
| Octal (base 8) | 161153 |
| Hexadecimal (base 16) | E26B |
| Base 3 | 2221111210 |
| As time | 57963 seconds = 16 h 6 min 3 s |
Is 57963 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 (57963 Ć· 3 = 19321) | 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 3) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 57963 a prime number?
No. 57963 = 3 Ć , so it is divisible by 3.
What are the factors of 57963?
1, 3, 139, 417, 19321, 57963.
What is 57963 in binary?
1110001001101011 (hexadecimal E26B, octal 161153).
What is the square root of 57963?
About 240.7551, exactly 139ā3.
Is 57963 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 57963?
It is a composite number with 6 divisors.