The number 48005
48005 is a composite number with 4 divisors. Its prime factorisation is 5 × 9601. Divisors (4): 1, 5, 9601, 48005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48005: a semiprime: 5 × 9601, the product of two primes.
- 2
48005 is composite. Its prime factorisation is
- 3
The divisors add up to 57612; without 48005 itself that is 9607, so 48005 is deficient (9607 is less than 48005). Euler's totient φ(48005) = 38400 numbers up to 48005 share no factor with it.
- 4
The digits of 48005 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48005 = 5 \times 9601 \]
48005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57612 |
| Euler totient φ(n) | 38400 |
| Square | 2304480025 |
| Cube | 110626563600125 |
| Square root | 219.100434 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8005 × |
48005 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and five |
| Binary (base 2) | 1011101110000101 |
| Octal (base 8) | 135605 |
| Hexadecimal (base 16) | BB85 |
| Base 3 | 2102211222 |
| As time | 48005 seconds = 13 h 20 min 5 s |
Is 48005 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 2) | 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 | Yes (48005 ÷ 5 = 9601) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48005 a prime number?
No. 48005 = 5 × 9601, so it is divisible by 5.
What are the factors of 48005?
1, 5, 9601, 48005.
What is 48005 in binary?
1011101110000101 (hexadecimal BB85, octal 135605).
What is the square root of 48005?
About 219.1004.
Is 48005 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 48005?
48005 is a semiprime: 5 × 9601, the product of two primes.