The number 59550
59550 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 397. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 397, 794, 1191, 1985 … 59550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59550 is composite. Its prime factorisation is
- 3
The divisors add up to 148056; without 59550 itself that is 88506, so 59550 is abundant (88506 is more than 59550). Euler's totient φ(59550) = 15840 numbers up to 59550 share no factor with it.
- 4
The digits of 59550 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59550 = 2 \times 3 \times 5^{2} \times 397 \]59550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 148056 |
| Euler totient φ(n) | 15840 |
| Square | 3546202500 |
| Cube | 211176358875000 |
| Square root | 244.028687 (= 5√2382) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.955 × |
59550 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand five hundred and fifty |
| Binary (base 2) | 1110100010011110 |
| Octal (base 8) | 164236 |
| Hexadecimal (base 16) | E89E |
| Base 3 | 10000200120 |
| As time | 59550 seconds = 16 h 32 min 30 s |
Is 59550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59550 ÷ 2 = 29775) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59550 ÷ 3 = 19850) | 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 (59550 ÷ 5 = 11910) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59550 ÷ 6 = 9925) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (59550 ÷ 10 = 5955) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 59550 a prime number?
No. 59550 = 2 × 3 × × 397, so it is divisible by 2.
What are the factors of 59550?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 397, 794, 1191, 1985, 2382, 3970, 5955, 9925, 11910, 19850, 29775, 59550.
What is 59550 in binary?
1110100010011110 (hexadecimal E89E, octal 164236).
What is the square root of 59550?
About 244.0287, exactly 5√2382.
Is 59550 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59550?
It is a composite number with 24 divisors.