The number 36951
36951 is a composite number with 8 divisors. Its prime factorisation is 3 × 109 × 113. Divisors (8): 1, 3, 109, 113, 327, 339, 12317, 36951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36951 is composite. Its prime factorisation is
- 3
The divisors add up to 50160; without 36951 itself that is 13209, so 36951 is deficient (13209 is less than 36951). Euler's totient φ(36951) = 24192 numbers up to 36951 share no factor with it.
- 4
The digits of 36951 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36951 = 3 \times 109 \times 113 \]
36951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 50160 |
| Euler totient φ(n) | 24192 |
| Square | 1365376401 |
| Cube | 50452023393351 |
| Square root | 192.226429 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6951 × |
36951 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-one |
| Binary (base 2) | 1001000001010111 |
| Octal (base 8) | 110127 |
| Hexadecimal (base 16) | 9057 |
| Base 3 | 1212200120 |
| As time | 36951 seconds = 10 h 15 min 51 s |
Is 36951 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 (36951 ÷ 3 = 12317) | 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 1) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36951 a prime number?
No. 36951 = 3 × 109 × 113, so it is divisible by 3.
What are the factors of 36951?
1, 3, 109, 113, 327, 339, 12317, 36951.
What is 36951 in binary?
1001000001010111 (hexadecimal 9057, octal 110127).
What is the square root of 36951?
About 192.2264.
Is 36951 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 36951?
It is a composite number with 8 divisors.