The number 47992
47992 is a composite number with 16 divisors. Its prime factorisation is × 7 × 857. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 857, 1714, 3428, 5999, 6856, 11998, 23996, 47992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47992 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47992 is composite. Its prime factorisation is
- 3
The divisors add up to 102960; without 47992 itself that is 54968, so 47992 is abundant (54968 is more than 47992). Euler's totient φ(47992) = 20544 numbers up to 47992 share no factor with it.
- 4
The digits of 47992 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47992 = 2^{3} \times 7 \times 857 \]47992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 102960 |
| Euler totient φ(n) | 20544 |
| Square | 2303232064 |
| Cube | 110536713215488 |
| Square root | 219.070765 (= 2√11998) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7992 × |
47992 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and ninety-two |
| Binary (base 2) | 1011101101111000 |
| Octal (base 8) | 135570 |
| Hexadecimal (base 16) | BB78 |
| Base 3 | 2102211111 |
| As time | 47992 seconds = 13 h 19 min 52 s |
Is 47992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47992 ÷ 2 = 23996) | 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 (47992 ÷ 4 = 11998) | 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 | Yes (47992 ÷ 7 = 6856) | 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 (47992 ÷ 8 = 5999) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | 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 47992 a prime number?
No. 47992 = × 7 × 857, so it is divisible by 2.
What are the factors of 47992?
1, 2, 4, 7, 8, 14, 28, 56, 857, 1714, 3428, 5999, 6856, 11998, 23996, 47992.
What is 47992 in binary?
1011101101111000 (hexadecimal BB78, octal 135570).
What is the square root of 47992?
About 219.0708, exactly 2√11998.
Is 47992 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 47992?
It is a composite number with 16 divisors.