The number 47956
47956 is a composite number with 12 divisors. Its prime factorisation is × 19 × 631. Divisors (12): 1, 2, 4, 19, 38, 76, 631, 1262, 2524, 11989, 23978, 47956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47956 is composite. Its prime factorisation is
- 3
The divisors add up to 88480; without 47956 itself that is 40524, so 47956 is deficient (40524 is less than 47956). Euler's totient φ(47956) = 22680 numbers up to 47956 share no factor with it.
- 4
The digits of 47956 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47956 = 2^{2} \times 19 \times 631 \]47956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 88480 |
| Euler totient φ(n) | 22680 |
| Square | 2299777936 |
| Cube | 110288150698816 |
| Square root | 218.988584 (= 2√11989) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7956 × |
47956 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-six |
| Binary (base 2) | 1011101101010100 |
| Octal (base 8) | 135524 |
| Hexadecimal (base 16) | BB54 |
| Base 3 | 2102210011 |
| As time | 47956 seconds = 13 h 19 min 16 s |
Is 47956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47956 ÷ 2 = 23978) | 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 (47956 ÷ 4 = 11989) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | 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 7) | 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 47956 a prime number?
No. 47956 = × 19 × 631, so it is divisible by 2.
What are the factors of 47956?
1, 2, 4, 19, 38, 76, 631, 1262, 2524, 11989, 23978, 47956.
What is 47956 in binary?
1011101101010100 (hexadecimal BB54, octal 135524).
What is the square root of 47956?
About 218.9886, exactly 2√11989.
Is 47956 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 47956?
It is a composite number with 12 divisors.