The number 36958
36958 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1087. Divisors (8): 1, 2, 17, 34, 1087, 2174, 18479, 36958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36958 is composite. Its prime factorisation is
- 3
The divisors add up to 58752; without 36958 itself that is 21794, so 36958 is deficient (21794 is less than 36958). Euler's totient φ(36958) = 17376 numbers up to 36958 share no factor with it.
- 4
The digits of 36958 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36958 = 2 \times 17 \times 1087 \]
36958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58752 |
| Euler totient φ(n) | 17376 |
| Square | 1365893764 |
| Cube | 50480701729912 |
| Square root | 192.244636 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 93 |
| Scientific notation | 3.6958 × |
36958 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-eight |
| Binary (base 2) | 1001000001011110 |
| Octal (base 8) | 110136 |
| Hexadecimal (base 16) | 905E |
| Base 3 | 1212200211 |
| As time | 36958 seconds = 10 h 15 min 58 s |
Is 36958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36958 ÷ 2 = 18479) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36958 a prime number?
No. 36958 = 2 × 17 × 1087, so it is divisible by 2.
What are the factors of 36958?
1, 2, 17, 34, 1087, 2174, 18479, 36958.
What is 36958 in binary?
1001000001011110 (hexadecimal 905E, octal 110136).
What is the square root of 36958?
About 192.2446.
Is 36958 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 36958?
It is a composite number with 8 divisors.