The number 3951
3951 is a binary palindrome (111101101111). Its prime factorisation is × 439. Divisors (6): 1, 3, 9, 439, 1317, 3951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3951: a binary palindrome (111101101111).
- 2
3951 is composite. Its prime factorisation is
- 3
The divisors add up to 5720; without 3951 itself that is 1769, so 3951 is deficient (1769 is less than 3951). Euler's totient φ(3951) = 2628 numbers up to 3951 share no factor with it.
- 4
The digits of 3951 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3951 = 3^{2} \times 439 \]3951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 5720 |
| Euler totient φ(n) | 2628 |
| Square | 15610401 |
| Cube | 61676694351 |
| Square root | 62.856981 (= 3√439) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 74 |
| Scientific notation | 3.951 × |
3951 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty-one |
| Roman numerals | MMMCMLI |
| Binary (base 2) | 111101101111 |
| Octal (base 8) | 7557 |
| Hexadecimal (base 16) | F6F |
| Base 3 | 12102100 |
| As time | 3951 seconds = 1 h 5 min 51 s |
Is 3951 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 | Yes (3951 ÷ 3 = 1317) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (3951 ÷ 9 = 439) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3951 a prime number?
No. 3951 = × 439, so it is divisible by 3.
What are the factors of 3951?
1, 3, 9, 439, 1317, 3951.
What is 3951 in binary?
111101101111 (hexadecimal F6F, octal 7557).
What is the square root of 3951?
About 62.8570, exactly 3√439.
What is 3951 in Roman numerals?
MMMCMLI.
Is 3951 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 3951?
3951 is a binary palindrome (111101101111).