The number 33605
33605 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 47. Divisors (16): 1, 5, 11, 13, 47, 55, 65, 143, 235, 517, 611, 715, 2585, 3055, 6721, 33605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 33605: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
33605 is composite. Its prime factorisation is
- 3
The divisors add up to 48384; without 33605 itself that is 14779, so 33605 is deficient (14779 is less than 33605). Euler's totient φ(33605) = 22080 numbers up to 33605 share no factor with it.
- 4
The digits of 33605 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 33605 = 5 \times 11 \times 13 \times 47 \]
33605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 48384 |
| Euler totient φ(n) | 22080 |
| Square | 1129296025 |
| Cube | 37949992920125 |
| Square root | 183.316666 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.3605 × |
33605 in other forms
| Form | Value |
|---|---|
| In words | thirty-three thousand six hundred and five |
| Binary (base 2) | 1000001101000101 |
| Octal (base 8) | 101505 |
| Hexadecimal (base 16) | 8345 |
| Base 3 | 1201002122 |
| As time | 33605 seconds = 9 h 20 min 5 s |
Is 33605 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 (33605 ÷ 5 = 6721) | 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 5) | 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 | Yes (33605 ÷ 11 = 3055) | 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 33605 a prime number?
No. 33605 = 5 × 11 × 13 × 47, so it is divisible by 5.
What are the factors of 33605?
1, 5, 11, 13, 47, 55, 65, 143, 235, 517, 611, 715, 2585, 3055, 6721, 33605.
What is 33605 in binary?
1000001101000101 (hexadecimal 8345, octal 101505).
What is the square root of 33605?
About 183.3167.
Is 33605 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 33605?
33605 is a happy number: repeatedly adding the squares of its digits reaches 1.