The number 56962
56962 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 1499. Divisors (8): 1, 2, 19, 38, 1499, 2998, 28481, 56962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56962 is composite. Its prime factorisation is
- 3
The divisors add up to 90000; without 56962 itself that is 33038, so 56962 is deficient (33038 is less than 56962). Euler's totient φ(56962) = 26964 numbers up to 56962 share no factor with it.
- 4
The digits of 56962 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56962 = 2 \times 19 \times 1499 \]
56962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90000 |
| Euler totient φ(n) | 26964 |
| Square | 3244669444 |
| Cube | 184822860869128 |
| Square root | 238.667132 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6962 × |
56962 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and sixty-two |
| Binary (base 2) | 1101111010000010 |
| Octal (base 8) | 157202 |
| Hexadecimal (base 16) | DE82 |
| Base 3 | 2220010201 |
| As time | 56962 seconds = 15 h 49 min 22 s |
Is 56962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56962 ÷ 2 = 28481) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56962 a prime number?
No. 56962 = 2 × 19 × 1499, so it is divisible by 2.
What are the factors of 56962?
1, 2, 19, 38, 1499, 2998, 28481, 56962.
What is 56962 in binary?
1101111010000010 (hexadecimal DE82, octal 157202).
What is the square root of 56962?
About 238.6671.
Is 56962 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 56962?
It is a composite number with 8 divisors.