The number 3950
3950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 79. Divisors (12): 1, 2, 5, 10, 25, 50, 79, 158, 395, 790, 1975, 3950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
3950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
3950 is composite. Its prime factorisation is
- 3
The divisors add up to 7440; without 3950 itself that is 3490, so 3950 is deficient (3490 is less than 3950). Euler's totient φ(3950) = 1560 numbers up to 3950 share no factor with it.
- 4
The digits of 3950 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3950 = 2 \times 5^{2} \times 79 \]3950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 7440 |
| Euler totient φ(n) | 1560 |
| Square | 15602500 |
| Cube | 61629875000 |
| Square root | 62.849025 (= 5√158) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 38 |
| Scientific notation | 3.95 × |
3950 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty |
| Roman numerals | MMMCML |
| Binary (base 2) | 111101101110 |
| Octal (base 8) | 7556 |
| Hexadecimal (base 16) | F6E |
| Base 3 | 12102022 |
| As time | 3950 seconds = 1 h 5 min 50 s |
Is 3950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3950 ÷ 2 = 1975) | 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 (3950 ÷ 5 = 790) | 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 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (3950 ÷ 10 = 395) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 3950 a prime number?
No. 3950 = 2 × × 79, so it is divisible by 2.
What are the factors of 3950?
1, 2, 5, 10, 25, 50, 79, 158, 395, 790, 1975, 3950.
What is 3950 in binary?
111101101110 (hexadecimal F6E, octal 7556).
What is the square root of 3950?
About 62.8490, exactly 5√158.
What is 3950 in Roman numerals?
MMMCML.
Is 3950 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 3950?
It is a composite number with 12 divisors.