The number 56058
56058 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9343. Divisors (8): 1, 2, 3, 6, 9343, 18686, 28029, 56058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56058 is composite. Its prime factorisation is
- 3
The divisors add up to 112128; without 56058 itself that is 56070, so 56058 is abundant (56070 is more than 56058). Euler's totient φ(56058) = 18684 numbers up to 56058 share no factor with it.
- 4
The digits of 56058 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56058 = 2 \times 3 \times 9343 \]
56058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112128 |
| Euler totient φ(n) | 18684 |
| Square | 3142499364 |
| Cube | 176162229347112 |
| Square root | 236.765707 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6058 × |
56058 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-eight |
| Binary (base 2) | 1101101011111010 |
| Octal (base 8) | 155372 |
| Hexadecimal (base 16) | DAFA |
| Base 3 | 2211220020 |
| As time | 56058 seconds = 15 h 34 min 18 s |
Is 56058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56058 ÷ 2 = 28029) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56058 ÷ 3 = 18686) | 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 (56058 ÷ 6 = 9343) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 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 | No (remainder 2) | 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 56058 a prime number?
No. 56058 = 2 × 3 × 9343, so it is divisible by 2.
What are the factors of 56058?
1, 2, 3, 6, 9343, 18686, 28029, 56058.
What is 56058 in binary?
1101101011111010 (hexadecimal DAFA, octal 155372).
What is the square root of 56058?
About 236.7657.
Is 56058 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56058?
It is a composite number with 8 divisors.