The number 36957
36957 is a composite number with 8 divisors. Its prime factorisation is 3 × 97 × 127. Divisors (8): 1, 3, 97, 127, 291, 381, 12319, 36957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36957 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36957 is composite. Its prime factorisation is
- 3
The divisors add up to 50176; without 36957 itself that is 13219, so 36957 is deficient (13219 is less than 36957). Euler's totient φ(36957) = 24192 numbers up to 36957 share no factor with it.
- 4
The digits of 36957 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36957 = 3 \times 97 \times 127 \]
36957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 50176 |
| Euler totient φ(n) | 24192 |
| Square | 1365819849 |
| Cube | 50476604159493 |
| Square root | 192.242035 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6957 × |
36957 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-seven |
| Binary (base 2) | 1001000001011101 |
| Octal (base 8) | 110135 |
| Hexadecimal (base 16) | 905D |
| Base 3 | 1212200210 |
| As time | 36957 seconds = 10 h 15 min 57 s |
Is 36957 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 | Yes (36957 ÷ 3 = 12319) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36957 a prime number?
No. 36957 = 3 × 97 × 127, so it is divisible by 3.
What are the factors of 36957?
1, 3, 97, 127, 291, 381, 12319, 36957.
What is 36957 in binary?
1001000001011101 (hexadecimal 905D, octal 110135).
What is the square root of 36957?
About 192.2420.
Is 36957 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 36957?
It is a composite number with 8 divisors.