The number 58095
58095 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1291. Divisors (12): 1, 3, 5, 9, 15, 45, 1291, 3873, 6455, 11619, 19365, 58095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58095 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58095 is composite. Its prime factorisation is
- 3
The divisors add up to 100776; without 58095 itself that is 42681, so 58095 is deficient (42681 is less than 58095). Euler's totient φ(58095) = 30960 numbers up to 58095 share no factor with it.
- 4
The digits of 58095 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58095 = 3^{2} \times 5 \times 1291 \]58095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 100776 |
| Euler totient φ(n) | 30960 |
| Square | 3375029025 |
| Cube | 196072311207375 |
| Square root | 241.029044 (= 3√6455) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.8095 × |
58095 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and ninety-five |
| Binary (base 2) | 1110001011101111 |
| Octal (base 8) | 161357 |
| Hexadecimal (base 16) | E2EF |
| Base 3 | 2221200200 |
| As time | 58095 seconds = 16 h 8 min 15 s |
Is 58095 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 (58095 ÷ 3 = 19365) | 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 (58095 ÷ 5 = 11619) | 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (58095 ÷ 9 = 6455) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58095 a prime number?
No. 58095 = × 5 × 1291, so it is divisible by 3.
What are the factors of 58095?
1, 3, 5, 9, 15, 45, 1291, 3873, 6455, 11619, 19365, 58095.
What is 58095 in binary?
1110001011101111 (hexadecimal E2EF, octal 161357).
What is the square root of 58095?
About 241.0290, exactly 3√6455.
Is 58095 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 58095?
It is a composite number with 12 divisors.