The number 48956
48956 is a composite number with 6 divisors. Its prime factorisation is × 12239. Divisors (6): 1, 2, 4, 12239, 24478, 48956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48956 is composite. Its prime factorisation is
- 3
The divisors add up to 85680; without 48956 itself that is 36724, so 48956 is deficient (36724 is less than 48956). Euler's totient φ(48956) = 24476 numbers up to 48956 share no factor with it.
- 4
The digits of 48956 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48956 = 2^{2} \times 12239 \]48956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 85680 |
| Euler totient φ(n) | 24476 |
| Square | 2396689936 |
| Cube | 117332352506816 |
| Square root | 221.260028 (= 2√12239) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8956 × |
48956 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-six |
| Binary (base 2) | 1011111100111100 |
| Octal (base 8) | 137474 |
| Hexadecimal (base 16) | BF3C |
| Base 3 | 2111011012 |
| As time | 48956 seconds = 13 h 35 min 56 s |
Is 48956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48956 ÷ 2 = 24478) | 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 (48956 ÷ 4 = 12239) | 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 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 48956 a prime number?
No. 48956 = × 12239, so it is divisible by 2.
What are the factors of 48956?
1, 2, 4, 12239, 24478, 48956.
What is 48956 in binary?
1011111100111100 (hexadecimal BF3C, octal 137474).
What is the square root of 48956?
About 221.2600, exactly 2√12239.
Is 48956 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48956?
It is a composite number with 6 divisors.