The number 47932
47932 is a composite number with 12 divisors. Its prime factorisation is × 23 × 521. Divisors (12): 1, 2, 4, 23, 46, 92, 521, 1042, 2084, 11983, 23966, 47932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47932 is composite. Its prime factorisation is
- 3
The divisors add up to 87696; without 47932 itself that is 39764, so 47932 is deficient (39764 is less than 47932). Euler's totient φ(47932) = 22880 numbers up to 47932 share no factor with it.
- 4
The digits of 47932 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47932 = 2^{2} \times 23 \times 521 \]47932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87696 |
| Euler totient φ(n) | 22880 |
| Square | 2297476624 |
| Cube | 110122649541568 |
| Square root | 218.933780 (= 2√11983) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.7932 × |
47932 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and thirty-two |
| Binary (base 2) | 1011101100111100 |
| Octal (base 8) | 135474 |
| Hexadecimal (base 16) | BB3C |
| Base 3 | 2102202021 |
| As time | 47932 seconds = 13 h 18 min 52 s |
Is 47932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47932 ÷ 2 = 23966) | 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 (47932 ÷ 4 = 11983) | 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 3) | 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 7) | 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 5) | 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 47932 a prime number?
No. 47932 = × 23 × 521, so it is divisible by 2.
What are the factors of 47932?
1, 2, 4, 23, 46, 92, 521, 1042, 2084, 11983, 23966, 47932.
What is 47932 in binary?
1011101100111100 (hexadecimal BB3C, octal 135474).
What is the square root of 47932?
About 218.9338, exactly 2√11983.
Is 47932 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47932?
It is a composite number with 12 divisors.