The number 47937
47937 is a composite number with 12 divisors. Its prime factorisation is 3 × 19 × . Divisors (12): 1, 3, 19, 29, 57, 87, 551, 841, 1653, 2523, 15979, 47937.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47937 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47937 is composite. Its prime factorisation is
- 3
The divisors add up to 69680; without 47937 itself that is 21743, so 47937 is deficient (21743 is less than 47937). Euler's totient φ(47937) = 29232 numbers up to 47937 share no factor with it.
- 4
The digits of 47937 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47937 = 3 \times 19 \times 29^{2} \]47937 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 69680 |
| Euler totient φ(n) | 29232 |
| Square | 2297955969 |
| Cube | 110157115285953 |
| Square root | 218.945199 (= 29√57) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7937 × |
47937 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and thirty-seven |
| Binary (base 2) | 1011101101000001 |
| Octal (base 8) | 135501 |
| Hexadecimal (base 16) | BB41 |
| Base 3 | 2102202110 |
| As time | 47937 seconds = 13 h 18 min 57 s |
Is 47937 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47937 ÷ 3 = 15979) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47937 a prime number?
No. 47937 = 3 × 19 × , so it is divisible by 3.
What are the factors of 47937?
1, 3, 19, 29, 57, 87, 551, 841, 1653, 2523, 15979, 47937.
What is 47937 in binary?
1011101101000001 (hexadecimal BB41, octal 135501).
What is the square root of 47937?
About 218.9452, exactly 29√57.
Is 47937 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 47937?
It is a composite number with 12 divisors.