The number 9950
9950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 199. Divisors (12): 1, 2, 5, 10, 25, 50, 199, 398, 995, 1990, 4975, 9950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9950 is composite. Its prime factorisation is
- 3
The divisors add up to 18600; without 9950 itself that is 8650, so 9950 is deficient (8650 is less than 9950). Euler's totient φ(9950) = 3960 numbers up to 9950 share no factor with it.
- 4
The digits of 9950 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9950 = 2 \times 5^{2} \times 199 \]9950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 18600 |
| Euler totient φ(n) | 3960 |
| Square | 99002500 |
| Cube | 985074875000 |
| Square root | 99.749687 (= 5√398) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 9.95 × |
9950 in other forms
| Form | Value |
|---|---|
| In words | nine thousand nine hundred and fifty |
| Binary (base 2) | 10011011011110 |
| Octal (base 8) | 23336 |
| Hexadecimal (base 16) | 26DE |
| Base 3 | 111122112 |
| As time | 9950 seconds = 2 h 45 min 50 s |
Is 9950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9950 ÷ 2 = 4975) | 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 | Yes (9950 ÷ 5 = 1990) | 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 | No (remainder 3) | 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 | Yes (9950 ÷ 10 = 995) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9950 a prime number?
No. 9950 = 2 × × 199, so it is divisible by 2.
What are the factors of 9950?
1, 2, 5, 10, 25, 50, 199, 398, 995, 1990, 4975, 9950.
What is 9950 in binary?
10011011011110 (hexadecimal 26DE, octal 23336).
What is the square root of 9950?
About 99.7497, exactly 5√398.
Is 9950 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 9950?
It is a composite number with 12 divisors.