The number 48508
48508 is a composite number with 12 divisors. Its prime factorisation is × 67 × 181. Divisors (12): 1, 2, 4, 67, 134, 181, 268, 362, 724, 12127, 24254, 48508.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48508 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48508 is composite. Its prime factorisation is
- 3
The divisors add up to 86632; without 48508 itself that is 38124, so 48508 is deficient (38124 is less than 48508). Euler's totient φ(48508) = 23760 numbers up to 48508 share no factor with it.
- 4
The digits of 48508 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48508 = 2^{2} \times 67 \times 181 \]48508 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86632 |
| Euler totient φ(n) | 23760 |
| Square | 2353026064 |
| Cube | 114140588312512 |
| Square root | 220.245318 (= 2√12127) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8508 × |
48508 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and eight |
| Binary (base 2) | 1011110101111100 |
| Octal (base 8) | 136574 |
| Hexadecimal (base 16) | BD7C |
| Base 3 | 2110112121 |
| As time | 48508 seconds = 13 h 28 min 28 s |
Is 48508 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48508 ÷ 2 = 24254) | 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 (48508 ÷ 4 = 12127) | 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 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 7) | 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 9) | 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 48508 a prime number?
No. 48508 = × 67 × 181, so it is divisible by 2.
What are the factors of 48508?
1, 2, 4, 67, 134, 181, 268, 362, 724, 12127, 24254, 48508.
What is 48508 in binary?
1011110101111100 (hexadecimal BD7C, octal 136574).
What is the square root of 48508?
About 220.2453, exactly 2√12127.
Is 48508 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48508?
It is a composite number with 12 divisors.