The number 48501
48501 is a composite number with 12 divisors. Its prime factorisation is × 17 × 317. Divisors (12): 1, 3, 9, 17, 51, 153, 317, 951, 2853, 5389, 16167, 48501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48501 is composite. Its prime factorisation is
- 3
The divisors add up to 74412; without 48501 itself that is 25911, so 48501 is deficient (25911 is less than 48501). Euler's totient φ(48501) = 30336 numbers up to 48501 share no factor with it.
- 4
The digits of 48501 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48501 = 3^{2} \times 17 \times 317 \]48501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74412 |
| Euler totient φ(n) | 30336 |
| Square | 2352347001 |
| Cube | 114091181895501 |
| Square root | 220.229426 (= 3√5389) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8501 × |
48501 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and one |
| Binary (base 2) | 1011110101110101 |
| Octal (base 8) | 136565 |
| Hexadecimal (base 16) | BD75 |
| Base 3 | 2110112100 |
| As time | 48501 seconds = 13 h 28 min 21 s |
Is 48501 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48501 ÷ 3 = 16167) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48501 ÷ 9 = 5389) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48501 a prime number?
No. 48501 = × 17 × 317, so it is divisible by 3.
What are the factors of 48501?
1, 3, 9, 17, 51, 153, 317, 951, 2853, 5389, 16167, 48501.
What is 48501 in binary?
1011110101110101 (hexadecimal BD75, octal 136565).
What is the square root of 48501?
About 220.2294, exactly 3√5389.
Is 48501 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 48501?
It is a composite number with 12 divisors.