The number 36851
36851 is a composite number with 4 divisors. Its prime factorisation is 43 × 857. Divisors (4): 1, 43, 857, 36851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36851: a semiprime: 43 × 857, the product of two primes.
- 2
36851 is composite. Its prime factorisation is
- 3
The divisors add up to 37752; without 36851 itself that is 901, so 36851 is deficient (901 is less than 36851). Euler's totient φ(36851) = 35952 numbers up to 36851 share no factor with it.
- 4
The digits of 36851 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36851 = 43 \times 857 \]
36851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 37752 |
| Euler totient φ(n) | 35952 |
| Square | 1357996201 |
| Cube | 50043518003051 |
| Square root | 191.966143 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.6851 × |
36851 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand eight hundred and fifty-one |
| Binary (base 2) | 1000111111110011 |
| Octal (base 8) | 107763 |
| Hexadecimal (base 16) | 8FF3 |
| Base 3 | 1212112212 |
| As time | 36851 seconds = 10 h 14 min 11 s |
Is 36851 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 1) | 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 3) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 36851 a prime number?
No. 36851 = 43 × 857, so it is divisible by 43.
What are the factors of 36851?
1, 43, 857, 36851.
What is 36851 in binary?
1000111111110011 (hexadecimal 8FF3, octal 107763).
What is the square root of 36851?
About 191.9661.
Is 36851 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 36851?
36851 is a semiprime: 43 × 857, the product of two primes.