The number 43952
43952 is a composite number with 20 divisors. Its prime factorisation is × 41 × 67. Divisors (20): 1, 2, 4, 8, 16, 41, 67, 82, 134, 164, 268, 328, 536, 656, 1072, 2747 … 43952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
43952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
43952 is composite. Its prime factorisation is
- 3
The divisors add up to 88536; without 43952 itself that is 44584, so 43952 is abundant (44584 is more than 43952). Euler's totient φ(43952) = 21120 numbers up to 43952 share no factor with it.
- 4
The digits of 43952 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 43952 = 2^{4} \times 41 \times 67 \]43952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 88536 |
| Euler totient φ(n) | 21120 |
| Square | 1931778304 |
| Cube | 84905520017408 |
| Square root | 209.647323 (= 4√2747) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.3952 × |
43952 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand nine hundred and fifty-two |
| Binary (base 2) | 1010101110110000 |
| Octal (base 8) | 125660 |
| Hexadecimal (base 16) | ABB0 |
| Base 3 | 2020021212 |
| As time | 43952 seconds = 12 h 12 min 32 s |
Is 43952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (43952 ÷ 2 = 21976) | 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 (43952 ÷ 4 = 10988) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (43952 ÷ 8 = 5494) | 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 2) | 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 43952 a prime number?
No. 43952 = × 41 × 67, so it is divisible by 2.
What are the factors of 43952?
1, 2, 4, 8, 16, 41, 67, 82, 134, 164, 268, 328, 536, 656, 1072, 2747, 5494, 10988, 21976, 43952.
What is 43952 in binary?
1010101110110000 (hexadecimal ABB0, octal 125660).
What is the square root of 43952?
About 209.6473, exactly 4√2747.
Is 43952 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 43952?
It is a composite number with 20 divisors.