The number 47912
47912 is a composite number with 16 divisors. Its prime factorisation is × 53 × 113. Divisors (16): 1, 2, 4, 8, 53, 106, 113, 212, 226, 424, 452, 904, 5989, 11978, 23956, 47912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47912 is composite. Its prime factorisation is
- 3
The divisors add up to 92340; without 47912 itself that is 44428, so 47912 is deficient (44428 is less than 47912). Euler's totient φ(47912) = 23296 numbers up to 47912 share no factor with it.
- 4
The digits of 47912 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47912 = 2^{3} \times 53 \times 113 \]47912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 92340 |
| Euler totient φ(n) | 23296 |
| Square | 2295559744 |
| Cube | 109984858454528 |
| Square root | 218.888099 (= 2√11978) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7912 × |
47912 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and twelve |
| Binary (base 2) | 1011101100101000 |
| Octal (base 8) | 135450 |
| Hexadecimal (base 16) | BB28 |
| Base 3 | 2102201112 |
| As time | 47912 seconds = 13 h 18 min 32 s |
Is 47912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47912 ÷ 2 = 23956) | 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 (47912 ÷ 4 = 11978) | 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 2) | 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 | Yes (47912 ÷ 8 = 5989) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 7) | 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 47912 a prime number?
No. 47912 = × 53 × 113, so it is divisible by 2.
What are the factors of 47912?
1, 2, 4, 8, 53, 106, 113, 212, 226, 424, 452, 904, 5989, 11978, 23956, 47912.
What is 47912 in binary?
1011101100101000 (hexadecimal BB28, octal 135450).
What is the square root of 47912?
About 218.8881, exactly 2√11978.
Is 47912 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 47912?
It is a composite number with 16 divisors.