The number 48968
48968 is a composite number with 8 divisors. Its prime factorisation is × 6121. Divisors (8): 1, 2, 4, 8, 6121, 12242, 24484, 48968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48968 is composite. Its prime factorisation is
- 3
The divisors add up to 91830; without 48968 itself that is 42862, so 48968 is deficient (42862 is less than 48968). Euler's totient φ(48968) = 24480 numbers up to 48968 share no factor with it.
- 4
The digits of 48968 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48968 = 2^{3} \times 6121 \]48968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91830 |
| Euler totient φ(n) | 24480 |
| Square | 2397865024 |
| Cube | 117418654495232 |
| Square root | 221.287144 (= 2√12242) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.8968 × |
48968 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and sixty-eight |
| Binary (base 2) | 1011111101001000 |
| Octal (base 8) | 137510 |
| Hexadecimal (base 16) | BF48 |
| Base 3 | 2111011122 |
| As time | 48968 seconds = 13 h 36 min 8 s |
Is 48968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48968 ÷ 2 = 24484) | 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 (48968 ÷ 4 = 12242) | 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 3) | 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 (48968 ÷ 8 = 6121) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 7) | 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 48968 a prime number?
No. 48968 = × 6121, so it is divisible by 2.
What are the factors of 48968?
1, 2, 4, 8, 6121, 12242, 24484, 48968.
What is 48968 in binary?
1011111101001000 (hexadecimal BF48, octal 137510).
What is the square root of 48968?
About 221.2871, exactly 2√12242.
Is 48968 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 48968?
It is a composite number with 8 divisors.