The number 36051
36051 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 197. Divisors (8): 1, 3, 61, 183, 197, 591, 12017, 36051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36051 is composite. Its prime factorisation is
- 3
The divisors add up to 49104; without 36051 itself that is 13053, so 36051 is deficient (13053 is less than 36051). Euler's totient φ(36051) = 23520 numbers up to 36051 share no factor with it.
- 4
The digits of 36051 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36051 = 3 \times 61 \times 197 \]
36051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 49104 |
| Euler totient φ(n) | 23520 |
| Square | 1299674601 |
| Cube | 46854569040651 |
| Square root | 189.871009 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.6051 × |
36051 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand and fifty-one |
| Binary (base 2) | 1000110011010011 |
| Octal (base 8) | 106323 |
| Hexadecimal (base 16) | 8CD3 |
| Base 3 | 1211110020 |
| As time | 36051 seconds = 10 h 0 min 51 s |
Is 36051 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 (36051 ÷ 3 = 12017) | 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 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 3) | 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 4) | 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 36051 a prime number?
No. 36051 = 3 × 61 × 197, so it is divisible by 3.
What are the factors of 36051?
1, 3, 61, 183, 197, 591, 12017, 36051.
What is 36051 in binary?
1000110011010011 (hexadecimal 8CD3, octal 106323).
What is the square root of 36051?
About 189.8710.
Is 36051 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 36051?
It is a composite number with 8 divisors.