The number 36959
36959 is a composite number with 4 divisors. Its prime factorisation is 13 × 2843. Divisors (4): 1, 13, 2843, 36959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36959: a semiprime: 13 × 2843, the product of two primes.
- 2
36959 is composite. Its prime factorisation is
- 3
The divisors add up to 39816; without 36959 itself that is 2857, so 36959 is deficient (2857 is less than 36959). Euler's totient φ(36959) = 34104 numbers up to 36959 share no factor with it.
- 4
The digits of 36959 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36959 = 13 \times 2843 \]
36959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 39816 |
| Euler totient φ(n) | 34104 |
| Square | 1365967681 |
| Cube | 50484799522079 |
| Square root | 192.247237 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 93 |
| Scientific notation | 3.6959 × |
36959 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-nine |
| Binary (base 2) | 1001000001011111 |
| Octal (base 8) | 110137 |
| Hexadecimal (base 16) | 905F |
| Base 3 | 1212200212 |
| As time | 36959 seconds = 10 h 15 min 59 s |
Is 36959 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 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 36959 a prime number?
No. 36959 = 13 × 2843, so it is divisible by 13.
What are the factors of 36959?
1, 13, 2843, 36959.
What is 36959 in binary?
1001000001011111 (hexadecimal 905F, octal 110137).
What is the square root of 36959?
About 192.2472.
Is 36959 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 36959?
36959 is a semiprime: 13 × 2843, the product of two primes.