The number 48601
48601 is a composite number with 8 divisors. Its prime factorisation is 7 × 53 × 131. Divisors (8): 1, 7, 53, 131, 371, 917, 6943, 48601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48601 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48601 is composite. Its prime factorisation is
- 3
The divisors add up to 57024; without 48601 itself that is 8423, so 48601 is deficient (8423 is less than 48601). Euler's totient φ(48601) = 40560 numbers up to 48601 share no factor with it.
- 4
The digits of 48601 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48601 = 7 \times 53 \times 131 \]
48601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57024 |
| Euler totient φ(n) | 40560 |
| Square | 2362057201 |
| Cube | 114798342025801 |
| Square root | 220.456345 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8601 × |
48601 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and one |
| Binary (base 2) | 1011110111011001 |
| Octal (base 8) | 136731 |
| Hexadecimal (base 16) | BDD9 |
| Base 3 | 2110200001 |
| As time | 48601 seconds = 13 h 30 min 1 s |
Is 48601 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48601 ÷ 7 = 6943) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48601 a prime number?
No. 48601 = 7 × 53 × 131, so it is divisible by 7.
What are the factors of 48601?
1, 7, 53, 131, 371, 917, 6943, 48601.
What is 48601 in binary?
1011110111011001 (hexadecimal BDD9, octal 136731).
What is the square root of 48601?
About 220.4563.
Is 48601 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48601?
It is a composite number with 8 divisors.