The number 33959
33959 is a composite number with 4 divisors. Its prime factorisation is 29 × 1171. Divisors (4): 1, 29, 1171, 33959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 33959: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1171, the product of two primes.
- 2
33959 is composite. Its prime factorisation is
- 3
The divisors add up to 35160; without 33959 itself that is 1201, so 33959 is deficient (1201 is less than 33959). Euler's totient φ(33959) = 32760 numbers up to 33959 share no factor with it.
- 4
The digits of 33959 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 33959 = 29 \times 1171 \]
33959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 35160 |
| Euler totient φ(n) | 32760 |
| Square | 1153213681 |
| Cube | 39161983393079 |
| Square root | 184.279679 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 142 |
| Scientific notation | 3.3959 × |
33959 in other forms
| Form | Value |
|---|---|
| In words | thirty-three thousand nine hundred and fifty-nine |
| Binary (base 2) | 1000010010100111 |
| Octal (base 8) | 102247 |
| Hexadecimal (base 16) | 84A7 |
| Base 3 | 1201120202 |
| As time | 33959 seconds = 9 h 25 min 59 s |
Is 33959 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 33959 a prime number?
No. 33959 = 29 × 1171, so it is divisible by 29.
What are the factors of 33959?
1, 29, 1171, 33959.
What is 33959 in binary?
1000010010100111 (hexadecimal 84A7, octal 102247).
What is the square root of 33959?
About 184.2797.
Is 33959 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 33959?
33959 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 1171, the product of two primes.