The number 9550
9550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 191. Divisors (12): 1, 2, 5, 10, 25, 50, 191, 382, 955, 1910, 4775, 9550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9550 is composite. Its prime factorisation is
- 3
The divisors add up to 17856; without 9550 itself that is 8306, so 9550 is deficient (8306 is less than 9550). Euler's totient φ(9550) = 3800 numbers up to 9550 share no factor with it.
- 4
The digits of 9550 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9550 = 2 \times 5^{2} \times 191 \]9550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 17856 |
| Euler totient φ(n) | 3800 |
| Square | 91202500 |
| Cube | 870983875000 |
| Square root | 97.724101 (= 5√382) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.55 × |
9550 in other forms
| Form | Value |
|---|---|
| In words | nine thousand five hundred and fifty |
| Binary (base 2) | 10010101001110 |
| Octal (base 8) | 22516 |
| Hexadecimal (base 16) | 254E |
| Base 3 | 111002201 |
| As time | 9550 seconds = 2 h 39 min 10 s |
Is 9550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9550 ÷ 2 = 4775) | 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 (9550 ÷ 5 = 1910) | 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 | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9550 ÷ 10 = 955) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9550 a prime number?
No. 9550 = 2 × × 191, so it is divisible by 2.
What are the factors of 9550?
1, 2, 5, 10, 25, 50, 191, 382, 955, 1910, 4775, 9550.
What is 9550 in binary?
10010101001110 (hexadecimal 254E, octal 22516).
What is the square root of 9550?
About 97.7241, exactly 5√382.
Is 9550 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 9550?
It is a composite number with 12 divisors.