The number 3956
3956 is a composite number with 12 divisors. Its prime factorisation is × 23 × 43. Divisors (12): 1, 2, 4, 23, 43, 46, 86, 92, 172, 989, 1978, 3956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3956: a Harshad number: divisible by its digit sum 23.
- 2
3956 is composite. Its prime factorisation is
- 3
The divisors add up to 7392; without 3956 itself that is 3436, so 3956 is deficient (3436 is less than 3956). Euler's totient φ(3956) = 1848 numbers up to 3956 share no factor with it.
- 4
The digits of 3956 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3956 = 2^{2} \times 23 \times 43 \]3956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 7392 |
| Euler totient φ(n) | 1848 |
| Square | 15649936 |
| Cube | 61911146816 |
| Square root | 62.896741 (= 2√989) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 51 |
| Scientific notation | 3.956 × |
3956 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty-six |
| Roman numerals | MMMCMLVI |
| Binary (base 2) | 111101110100 |
| Octal (base 8) | 7564 |
| Hexadecimal (base 16) | F74 |
| Base 3 | 12102112 |
| As time | 3956 seconds = 1 h 5 min 56 s |
Is 3956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3956 ÷ 2 = 1978) | 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 | Yes (3956 ÷ 4 = 989) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3956 a prime number?
No. 3956 = × 23 × 43, so it is divisible by 2.
What are the factors of 3956?
1, 2, 4, 23, 43, 46, 86, 92, 172, 989, 1978, 3956.
What is 3956 in binary?
111101110100 (hexadecimal F74, octal 7564).
What is the square root of 3956?
About 62.8967, exactly 2√989.
What is 3956 in Roman numerals?
MMMCMLVI.
Is 3956 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 3956?
3956 is a Harshad number: divisible by its digit sum 23.