The number 3959
3959 is a composite number with 4 divisors. Its prime factorisation is 37 × 107. Divisors (4): 1, 37, 107, 3959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3959: a semiprime: 37 × 107, the product of two primes.
- 2
3959 is composite. Its prime factorisation is
- 3
The divisors add up to 4104; without 3959 itself that is 145, so 3959 is deficient (145 is less than 3959). Euler's totient φ(3959) = 3816 numbers up to 3959 share no factor with it.
- 4
The digits of 3959 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 144 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3959 = 37 \times 107 \]
3959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4104 |
| Euler totient φ(n) | 3816 |
| Square | 15673681 |
| Cube | 62052103079 |
| Square root | 62.920585 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 144 |
| Scientific notation | 3.959 × |
3959 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty-nine |
| Roman numerals | MMMCMLIX |
| Binary (base 2) | 111101110111 |
| Octal (base 8) | 7567 |
| Hexadecimal (base 16) | F77 |
| Base 3 | 12102122 |
| As time | 3959 seconds = 1 h 5 min 59 s |
Is 3959 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | 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 | No (remainder 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3959 a prime number?
No. 3959 = 37 × 107, so it is divisible by 37.
What are the factors of 3959?
1, 37, 107, 3959.
What is 3959 in binary?
111101110111 (hexadecimal F77, octal 7567).
What is the square root of 3959?
About 62.9206.
What is 3959 in Roman numerals?
MMMCMLIX.
Is 3959 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 3959?
3959 is a semiprime: 37 × 107, the product of two primes.