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