The number 36068
36068 is a composite number with 12 divisors. Its prime factorisation is × 71 × 127. Divisors (12): 1, 2, 4, 71, 127, 142, 254, 284, 508, 9017, 18034, 36068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36068 is composite. Its prime factorisation is
- 3
The divisors add up to 64512; without 36068 itself that is 28444, so 36068 is deficient (28444 is less than 36068). Euler's totient φ(36068) = 17640 numbers up to 36068 share no factor with it.
- 4
The digits of 36068 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36068 = 2^{2} \times 71 \times 127 \]36068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 64512 |
| Euler totient φ(n) | 17640 |
| Square | 1300900624 |
| Cube | 46920883706432 |
| Square root | 189.915771 (= 2√9017) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.6068 × |
36068 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand and sixty-eight |
| Binary (base 2) | 1000110011100100 |
| Octal (base 8) | 106344 |
| Hexadecimal (base 16) | 8CE4 |
| Base 3 | 1211110212 |
| As time | 36068 seconds = 10 h 1 min 8 s |
Is 36068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36068 ÷ 2 = 18034) | 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 | Yes (36068 ÷ 4 = 9017) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36068 a prime number?
No. 36068 = × 71 × 127, so it is divisible by 2.
What are the factors of 36068?
1, 2, 4, 71, 127, 142, 254, 284, 508, 9017, 18034, 36068.
What is 36068 in binary?
1000110011100100 (hexadecimal 8CE4, octal 106344).
What is the square root of 36068?
About 189.9158, exactly 2√9017.
Is 36068 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 36068?
It is a composite number with 12 divisors.