The number 58505
58505 is a composite number with 4 divisors. Its prime factorisation is 5 × 11701. Divisors (4): 1, 5, 11701, 58505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58505: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11701, the product of two primes.
- 2
58505 is composite. Its prime factorisation is
- 3
The divisors add up to 70212; without 58505 itself that is 11707, so 58505 is deficient (11707 is less than 58505). Euler's totient φ(58505) = 46800 numbers up to 58505 share no factor with it.
- 4
The digits of 58505 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58505 = 5 \times 11701 \]
58505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70212 |
| Euler totient φ(n) | 46800 |
| Square | 3422835025 |
| Cube | 200252963137625 |
| Square root | 241.878068 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.8505 × |
58505 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand five hundred and five |
| Binary (base 2) | 1110010010001001 |
| Octal (base 8) | 162211 |
| Hexadecimal (base 16) | E489 |
| Base 3 | 2222020212 |
| As time | 58505 seconds = 16 h 15 min 5 s |
Is 58505 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 (58505 ÷ 5 = 11701) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 7) | 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 58505 a prime number?
No. 58505 = 5 × 11701, so it is divisible by 5.
What are the factors of 58505?
1, 5, 11701, 58505.
What is 58505 in binary?
1110010010001001 (hexadecimal E489, octal 162211).
What is the square root of 58505?
About 241.8781.
Is 58505 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 58505?
58505 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11701, the product of two primes.