The number 8950
8950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 179. Divisors (12): 1, 2, 5, 10, 25, 50, 179, 358, 895, 1790, 4475, 8950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
8950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
8950 is composite. Its prime factorisation is
- 3
The divisors add up to 16740; without 8950 itself that is 7790, so 8950 is deficient (7790 is less than 8950). Euler's totient φ(8950) = 3560 numbers up to 8950 share no factor with it.
- 4
The digits of 8950 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8950 = 2 \times 5^{2} \times 179 \]8950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 16740 |
| Euler totient φ(n) | 3560 |
| Square | 80102500 |
| Cube | 716917375000 |
| Square root | 94.604440 (= 5√358) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 140 |
| Scientific notation | 8.95 × |
8950 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and fifty |
| Binary (base 2) | 10001011110110 |
| Octal (base 8) | 21366 |
| Hexadecimal (base 16) | 22F6 |
| Base 3 | 110021111 |
| As time | 8950 seconds = 2 h 29 min 10 s |
Is 8950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8950 ÷ 2 = 4475) | 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 (8950 ÷ 5 = 1790) | 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 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (8950 ÷ 10 = 895) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8950 a prime number?
No. 8950 = 2 × × 179, so it is divisible by 2.
What are the factors of 8950?
1, 2, 5, 10, 25, 50, 179, 358, 895, 1790, 4475, 8950.
What is 8950 in binary?
10001011110110 (hexadecimal 22F6, octal 21366).
What is the square root of 8950?
About 94.6044, exactly 5√358.
Is 8950 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 8950?
It is a composite number with 12 divisors.