The number 5950
5950 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 17. Divisors (24): 1, 2, 5, 7, 10, 14, 17, 25, 34, 35, 50, 70, 85, 119, 170, 175 … 5950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5950 is composite. Its prime factorisation is
- 3
The divisors add up to 13392; without 5950 itself that is 7442, so 5950 is abundant (7442 is more than 5950). Euler's totient φ(5950) = 1920 numbers up to 5950 share no factor with it.
- 4
The digits of 5950 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 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5950 = 2 \times 5^{2} \times 7 \times 17 \]5950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 13392 |
| Euler totient φ(n) | 1920 |
| Square | 35402500 |
| Cube | 210644875000 |
| Square root | 77.136243 (= 5√238) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 49 |
| Scientific notation | 5.95 × |
5950 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and fifty |
| Binary (base 2) | 1011100111110 |
| Octal (base 8) | 13476 |
| Hexadecimal (base 16) | 173E |
| Base 3 | 22011101 |
| As time | 5950 seconds = 1 h 39 min 10 s |
Is 5950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5950 ÷ 2 = 2975) | 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 (5950 ÷ 5 = 1190) | 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 (5950 ÷ 7 = 850) | 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 (5950 ÷ 10 = 595) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 5950 a prime number?
No. 5950 = 2 × × 7 × 17, so it is divisible by 2.
What are the factors of 5950?
1, 2, 5, 7, 10, 14, 17, 25, 34, 35, 50, 70, 85, 119, 170, 175, 238, 350, 425, 595, 850, 1190, 2975, 5950.
What is 5950 in binary?
1011100111110 (hexadecimal 173E, octal 13476).
What is the square root of 5950?
About 77.1362, exactly 5√238.
Is 5950 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5950?
It is a composite number with 24 divisors.