The number 59005
59005 is a composite number with 4 divisors. Its prime factorisation is 5 × 11801. Divisors (4): 1, 5, 11801, 59005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59005: a semiprime: 5 × 11801, the product of two primes.
- 2
59005 is composite. Its prime factorisation is
- 3
The divisors add up to 70812; without 59005 itself that is 11807, so 59005 is deficient (11807 is less than 59005). Euler's totient φ(59005) = 47200 numbers up to 59005 share no factor with it.
- 4
The digits of 59005 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59005 = 5 \times 11801 \]
59005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70812 |
| Euler totient φ(n) | 47200 |
| Square | 3481590025 |
| Cube | 205431219425125 |
| Square root | 242.909448 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.9005 × |
59005 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and five |
| Binary (base 2) | 1110011001111101 |
| Octal (base 8) | 163175 |
| Hexadecimal (base 16) | E67D |
| Base 3 | 2222221101 |
| As time | 59005 seconds = 16 h 23 min 25 s |
Is 59005 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 | Yes (59005 ÷ 5 = 11801) | 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 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 5) | 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 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59005 a prime number?
No. 59005 = 5 × 11801, so it is divisible by 5.
What are the factors of 59005?
1, 5, 11801, 59005.
What is 59005 in binary?
1110011001111101 (hexadecimal E67D, octal 163175).
What is the square root of 59005?
About 242.9094.
Is 59005 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 59005?
59005 is a semiprime: 5 × 11801, the product of two primes.