The number 47968
47968 is a composite number with 12 divisors. Its prime factorisation is × 1499. Divisors (12): 1, 2, 4, 8, 16, 32, 1499, 2998, 5996, 11992, 23984, 47968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47968 is composite. Its prime factorisation is
- 3
The divisors add up to 94500; without 47968 itself that is 46532, so 47968 is deficient (46532 is less than 47968). Euler's totient φ(47968) = 23968 numbers up to 47968 share no factor with it.
- 4
The digits of 47968 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47968 = 2^{5} \times 1499 \]47968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 94500 |
| Euler totient φ(n) | 23968 |
| Square | 2300929024 |
| Cube | 110370963423232 |
| Square root | 219.015981 (= 4√2998) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7968 × |
47968 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and sixty-eight |
| Binary (base 2) | 1011101101100000 |
| Octal (base 8) | 135540 |
| Hexadecimal (base 16) | BB60 |
| Base 3 | 2102210121 |
| As time | 47968 seconds = 13 h 19 min 28 s |
Is 47968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47968 ÷ 2 = 23984) | 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 (47968 ÷ 4 = 11992) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 (47968 ÷ 8 = 5996) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 47968 a prime number?
No. 47968 = × 1499, so it is divisible by 2.
What are the factors of 47968?
1, 2, 4, 8, 16, 32, 1499, 2998, 5996, 11992, 23984, 47968.
What is 47968 in binary?
1011101101100000 (hexadecimal BB60, octal 135540).
What is the square root of 47968?
About 219.0160, exactly 4√2998.
Is 47968 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 47968?
It is a composite number with 12 divisors.