The number 48568
48568 is a composite number with 16 divisors. Its prime factorisation is × 13 × 467. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 467, 934, 1868, 3736, 6071, 12142, 24284, 48568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48568 is composite. Its prime factorisation is
- 3
The divisors add up to 98280; without 48568 itself that is 49712, so 48568 is abundant (49712 is more than 48568). Euler's totient φ(48568) = 22368 numbers up to 48568 share no factor with it.
- 4
The digits of 48568 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48568 = 2^{3} \times 13 \times 467 \]48568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98280 |
| Euler totient φ(n) | 22368 |
| Square | 2358850624 |
| Cube | 114564657106432 |
| Square root | 220.381487 (= 2√12142) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8568 × |
48568 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and sixty-eight |
| Binary (base 2) | 1011110110111000 |
| Octal (base 8) | 136670 |
| Hexadecimal (base 16) | BDB8 |
| Base 3 | 2110121211 |
| As time | 48568 seconds = 13 h 29 min 28 s |
Is 48568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48568 ÷ 2 = 24284) | 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 (48568 ÷ 4 = 12142) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (48568 ÷ 8 = 6071) | 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 8) | 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 48568 a prime number?
No. 48568 = × 13 × 467, so it is divisible by 2.
What are the factors of 48568?
1, 2, 4, 8, 13, 26, 52, 104, 467, 934, 1868, 3736, 6071, 12142, 24284, 48568.
What is 48568 in binary?
1011110110111000 (hexadecimal BDB8, octal 136670).
What is the square root of 48568?
About 220.3815, exactly 2√12142.
Is 48568 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48568?
It is a composite number with 16 divisors.