The number 56958
56958 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 863. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 863, 1726, 2589, 5178, 9493, 18986, 28479, 56958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56958: a Harshad number: divisible by its digit sum 33.
- 2
56958 is composite. Its prime factorisation is
- 3
The divisors add up to 124416; without 56958 itself that is 67458, so 56958 is abundant (67458 is more than 56958). Euler's totient φ(56958) = 17240 numbers up to 56958 share no factor with it.
- 4
The digits of 56958 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56958 = 2 \times 3 \times 11 \times 863 \]
56958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 124416 |
| Euler totient φ(n) | 17240 |
| Square | 3244213764 |
| Cube | 184783927569912 |
| Square root | 238.658752 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6958 × |
56958 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and fifty-eight |
| Binary (base 2) | 1101111001111110 |
| Octal (base 8) | 157176 |
| Hexadecimal (base 16) | DE7E |
| Base 3 | 2220010120 |
| As time | 56958 seconds = 15 h 49 min 18 s |
Is 56958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56958 ÷ 2 = 28479) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56958 ÷ 3 = 18986) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (56958 ÷ 6 = 9493) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56958 ÷ 11 = 5178) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56958 a prime number?
No. 56958 = 2 × 3 × 11 × 863, so it is divisible by 2.
What are the factors of 56958?
1, 2, 3, 6, 11, 22, 33, 66, 863, 1726, 2589, 5178, 9493, 18986, 28479, 56958.
What is 56958 in binary?
1101111001111110 (hexadecimal DE7E, octal 157176).
What is the square root of 56958?
About 238.6588.
Is 56958 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 56958?
56958 is a Harshad number: divisible by its digit sum 33.