The number 47964
47964 is a composite number with 24 divisors. Its prime factorisation is × 3 × 7 × 571. Divisors (24): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 571, 1142, 1713, 2284 … 47964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47964 is composite. Its prime factorisation is
- 3
The divisors add up to 128128; without 47964 itself that is 80164, so 47964 is abundant (80164 is more than 47964). Euler's totient φ(47964) = 13680 numbers up to 47964 share no factor with it.
- 4
The digits of 47964 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47964 = 2^{2} \times 3 \times 7 \times 571 \]47964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 128128 |
| Euler totient φ(n) | 13680 |
| Square | 2300545296 |
| Cube | 110343354577344 |
| Square root | 219.006849 (= 2√11991) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7964 × |
47964 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and sixty-four |
| Binary (base 2) | 1011101101011100 |
| Octal (base 8) | 135534 |
| Hexadecimal (base 16) | BB5C |
| Base 3 | 2102210110 |
| As time | 47964 seconds = 13 h 19 min 24 s |
Is 47964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47964 ÷ 2 = 23982) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47964 ÷ 3 = 15988) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (47964 ÷ 4 = 11991) | 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 | Yes (47964 ÷ 6 = 7994) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (47964 ÷ 7 = 6852) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (47964 ÷ 12 = 3997) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47964 a prime number?
No. 47964 = × 3 × 7 × 571, so it is divisible by 2.
What are the factors of 47964?
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 571, 1142, 1713, 2284, 3426, 3997, 6852, 7994, 11991, 15988, 23982, 47964.
What is 47964 in binary?
1011101101011100 (hexadecimal BB5C, octal 135534).
What is the square root of 47964?
About 219.0068, exactly 2√11991.
Is 47964 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 47964?
It is a composite number with 24 divisors.