The number 55958
55958 is a composite number with 12 divisors. Its prime factorisation is 2 × × 571. Divisors (12): 1, 2, 7, 14, 49, 98, 571, 1142, 3997, 7994, 27979, 55958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55958 is composite. Its prime factorisation is
- 3
The divisors add up to 97812; without 55958 itself that is 41854, so 55958 is deficient (41854 is less than 55958). Euler's totient φ(55958) = 23940 numbers up to 55958 share no factor with it.
- 4
The digits of 55958 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55958 = 2 \times 7^{2} \times 571 \]55958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97812 |
| Euler totient φ(n) | 23940 |
| Square | 3131297764 |
| Cube | 175221160277912 |
| Square root | 236.554433 (= 7√1142) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5958 × |
55958 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifty-eight |
| Binary (base 2) | 1101101010010110 |
| Octal (base 8) | 155226 |
| Hexadecimal (base 16) | DA96 |
| Base 3 | 2211202112 |
| As time | 55958 seconds = 15 h 32 min 38 s |
Is 55958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55958 ÷ 2 = 27979) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (55958 ÷ 7 = 7994) | 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 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55958 a prime number?
No. 55958 = 2 × × 571, so it is divisible by 2.
What are the factors of 55958?
1, 2, 7, 14, 49, 98, 571, 1142, 3997, 7994, 27979, 55958.
What is 55958 in binary?
1101101010010110 (hexadecimal DA96, octal 155226).
What is the square root of 55958?
About 236.5544, exactly 7√1142.
Is 55958 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 55958?
It is a composite number with 12 divisors.