The number 3952
3952 is a composite number with 20 divisors. Its prime factorisation is × 13 × 19. Divisors (20): 1, 2, 4, 8, 13, 16, 19, 26, 38, 52, 76, 104, 152, 208, 247, 304 … 3952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3952: a Harshad number: divisible by its digit sum 19.
- 2
3952 is composite. Its prime factorisation is
- 3
The divisors add up to 8680; without 3952 itself that is 4728, so 3952 is abundant (4728 is more than 3952). Euler's totient φ(3952) = 1728 numbers up to 3952 share no factor with it.
- 4
The digits of 3952 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 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3952 = 2^{4} \times 13 \times 19 \]3952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 8680 |
| Euler totient φ(n) | 1728 |
| Square | 15618304 |
| Cube | 61723537408 |
| Square root | 62.864935 (= 4√247) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 51 |
| Scientific notation | 3.952 × |
3952 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty-two |
| Roman numerals | MMMCMLII |
| Binary (base 2) | 111101110000 |
| Octal (base 8) | 7560 |
| Hexadecimal (base 16) | F70 |
| Base 3 | 12102101 |
| As time | 3952 seconds = 1 h 5 min 52 s |
Is 3952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3952 ÷ 2 = 1976) | 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 | Yes (3952 ÷ 4 = 988) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | 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 | Yes (3952 ÷ 8 = 494) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3952 a prime number?
No. 3952 = × 13 × 19, so it is divisible by 2.
What are the factors of 3952?
1, 2, 4, 8, 13, 16, 19, 26, 38, 52, 76, 104, 152, 208, 247, 304, 494, 988, 1976, 3952.
What is 3952 in binary?
111101110000 (hexadecimal F70, octal 7560).
What is the square root of 3952?
About 62.8649, exactly 4√247.
What is 3952 in Roman numerals?
MMMCMLII.
Is 3952 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 3952?
3952 is a Harshad number: divisible by its digit sum 19.