The number 55930
55930 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 17 × 47. Divisors (32): 1, 2, 5, 7, 10, 14, 17, 34, 35, 47, 70, 85, 94, 119, 170, 235 … 55930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55930 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55930 is composite. Its prime factorisation is
- 3
The divisors add up to 124416; without 55930 itself that is 68486, so 55930 is abundant (68486 is more than 55930). Euler's totient φ(55930) = 17664 numbers up to 55930 share no factor with it.
- 4
The digits of 55930 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55930 = 2 \times 5 \times 7 \times 17 \times 47 \]
55930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 124416 |
| Euler totient φ(n) | 17664 |
| Square | 3128164900 |
| Cube | 174958262857000 |
| Square root | 236.495243 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.593 × |
55930 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty |
| Binary (base 2) | 1101101001111010 |
| Octal (base 8) | 155172 |
| Hexadecimal (base 16) | DA7A |
| Base 3 | 2211201111 |
| As time | 55930 seconds = 15 h 32 min 10 s |
Is 55930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55930 ÷ 2 = 27965) | 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 | Yes (55930 ÷ 5 = 11186) | 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 | Yes (55930 ÷ 7 = 7990) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55930 ÷ 10 = 5593) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 55930 a prime number?
No. 55930 = 2 × 5 × 7 × 17 × 47, so it is divisible by 2.
What are the factors of 55930?
1, 2, 5, 7, 10, 14, 17, 34, 35, 47, 70, 85, 94, 119, 170, 235, 238, 329, 470, 595, 658, 799, 1190, 1598, 1645, 3290, 3995, 5593, 7990, 11186, 27965, 55930.
What is 55930 in binary?
1101101001111010 (hexadecimal DA7A, octal 155172).
What is the square root of 55930?
About 236.4952.
Is 55930 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55930?
It is a composite number with 32 divisors.