The number 47982
47982 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 727. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 727, 1454, 2181, 4362, 7997, 15994, 23991, 47982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47982 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 47982 itself that is 56850, so 47982 is abundant (56850 is more than 47982). Euler's totient φ(47982) = 14520 numbers up to 47982 share no factor with it.
- 4
The digits of 47982 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47982 = 2 \times 3 \times 11 \times 727 \]
47982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 14520 |
| Square | 2302272324 |
| Cube | 110467630650168 |
| Square root | 219.047940 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7982 × |
47982 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and eighty-two |
| Binary (base 2) | 1011101101101110 |
| Octal (base 8) | 135556 |
| Hexadecimal (base 16) | BB6E |
| Base 3 | 2102211010 |
| As time | 47982 seconds = 13 h 19 min 42 s |
Is 47982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47982 ÷ 2 = 23991) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47982 ÷ 3 = 15994) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (47982 ÷ 6 = 7997) | 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 | No (remainder 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (47982 ÷ 11 = 4362) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47982 a prime number?
No. 47982 = 2 × 3 × 11 × 727, so it is divisible by 2.
What are the factors of 47982?
1, 2, 3, 6, 11, 22, 33, 66, 727, 1454, 2181, 4362, 7997, 15994, 23991, 47982.
What is 47982 in binary?
1011101101101110 (hexadecimal BB6E, octal 135556).
What is the square root of 47982?
About 219.0479.
Is 47982 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 47982?
It is a composite number with 16 divisors.