The number 48595
48595 is a composite number with 4 divisors. Its prime factorisation is 5 × 9719. Divisors (4): 1, 5, 9719, 48595.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48595: a semiprime: 5 × 9719, the product of two primes.
- 2
48595 is composite. Its prime factorisation is
- 3
The divisors add up to 58320; without 48595 itself that is 9725, so 48595 is deficient (9725 is less than 48595). Euler's totient φ(48595) = 38872 numbers up to 48595 share no factor with it.
- 4
The digits of 48595 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48595 = 5 \times 9719 \]
48595 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58320 |
| Euler totient φ(n) | 38872 |
| Square | 2361474025 |
| Cube | 114755830244875 |
| Square root | 220.442736 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8595 × |
48595 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and ninety-five |
| Binary (base 2) | 1011110111010011 |
| Octal (base 8) | 136723 |
| Hexadecimal (base 16) | BDD3 |
| Base 3 | 2110122211 |
| As time | 48595 seconds = 13 h 29 min 55 s |
Is 48595 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48595 ÷ 5 = 9719) | 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 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48595 a prime number?
No. 48595 = 5 × 9719, so it is divisible by 5.
What are the factors of 48595?
1, 5, 9719, 48595.
What is 48595 in binary?
1011110111010011 (hexadecimal BDD3, octal 136723).
What is the square root of 48595?
About 220.4427.
Is 48595 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48595?
48595 is a semiprime: 5 × 9719, the product of two primes.