The number 47936
47936 is a composite number with 28 divisors. Its prime factorisation is × 7 × 107. Divisors (28): 1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 107, 112, 214, 224, 428 … 47936.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47936 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47936 is composite. Its prime factorisation is
- 3
The divisors add up to 109728; without 47936 itself that is 61792, so 47936 is abundant (61792 is more than 47936). Euler's totient φ(47936) = 20352 numbers up to 47936 share no factor with it.
- 4
The digits of 47936 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47936 = 2^{6} \times 7 \times 107 \]47936 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 109728 |
| Euler totient φ(n) | 20352 |
| Square | 2297860096 |
| Cube | 110150221561856 |
| Square root | 218.942915 (= 8√749) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7936 × |
47936 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and thirty-six |
| Binary (base 2) | 1011101101000000 |
| Octal (base 8) | 135500 |
| Hexadecimal (base 16) | BB40 |
| Base 3 | 2102202102 |
| As time | 47936 seconds = 13 h 18 min 56 s |
Is 47936 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47936 ÷ 2 = 23968) | 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 (47936 ÷ 4 = 11984) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (47936 ÷ 7 = 6848) | 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 (47936 ÷ 8 = 5992) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 47936 a prime number?
No. 47936 = × 7 × 107, so it is divisible by 2.
What are the factors of 47936?
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 107, 112, 214, 224, 428, 448, 749, 856, 1498, 1712, 2996, 3424, 5992, 6848, 11984, 23968, 47936.
What is 47936 in binary?
1011101101000000 (hexadecimal BB40, octal 135500).
What is the square root of 47936?
About 218.9429, exactly 8√749.
Is 47936 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 47936?
It is a composite number with 28 divisors.