The number 47948
47948 is a composite number with 6 divisors. Its prime factorisation is × 11987. Divisors (6): 1, 2, 4, 11987, 23974, 47948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47948: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
47948 is composite. Its prime factorisation is
- 3
The divisors add up to 83916; without 47948 itself that is 35968, so 47948 is deficient (35968 is less than 47948). Euler's totient φ(47948) = 23972 numbers up to 47948 share no factor with it.
- 4
The digits of 47948 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47948 = 2^{2} \times 11987 \]47948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 83916 |
| Euler totient φ(n) | 23972 |
| Square | 2299010704 |
| Cube | 110232965235392 |
| Square root | 218.970318 (= 2√11987) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7948 × |
47948 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and forty-eight |
| Binary (base 2) | 1011101101001100 |
| Octal (base 8) | 135514 |
| Hexadecimal (base 16) | BB4C |
| Base 3 | 2102202212 |
| As time | 47948 seconds = 13 h 19 min 8 s |
Is 47948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47948 ÷ 2 = 23974) | 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 (47948 ÷ 4 = 11987) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 5) | 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 10) | 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 47948 a prime number?
No. 47948 = × 11987, so it is divisible by 2.
What are the factors of 47948?
1, 2, 4, 11987, 23974, 47948.
What is 47948 in binary?
1011101101001100 (hexadecimal BB4C, octal 135514).
What is the square root of 47948?
About 218.9703, exactly 2√11987.
Is 47948 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 47948?
47948 is a happy number: repeatedly adding the squares of its digits reaches 1.