The number 36751
36751 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 257. Divisors (8): 1, 11, 13, 143, 257, 2827, 3341, 36751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36751 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36751 is composite. Its prime factorisation is
- 3
The divisors add up to 43344; without 36751 itself that is 6593, so 36751 is deficient (6593 is less than 36751). Euler's totient φ(36751) = 30720 numbers up to 36751 share no factor with it.
- 4
The digits of 36751 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36751 = 11 \times 13 \times 257 \]
36751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 43344 |
| Euler totient φ(n) | 30720 |
| Square | 1350636001 |
| Cube | 49637223672751 |
| Square root | 191.705503 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 62 |
| Scientific notation | 3.6751 × |
36751 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand seven hundred and fifty-one |
| Binary (base 2) | 1000111110001111 |
| Octal (base 8) | 107617 |
| Hexadecimal (base 16) | 8F8F |
| Base 3 | 1212102011 |
| As time | 36751 seconds = 10 h 12 min 31 s |
Is 36751 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | 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 | Yes (36751 ÷ 11 = 3341) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36751 a prime number?
No. 36751 = 11 × 13 × 257, so it is divisible by 11.
What are the factors of 36751?
1, 11, 13, 143, 257, 2827, 3341, 36751.
What is 36751 in binary?
1000111110001111 (hexadecimal 8F8F, octal 107617).
What is the square root of 36751?
About 191.7055.
Is 36751 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 36751?
It is a composite number with 8 divisors.