The number 36412
36412 is a composite number with 6 divisors. Its prime factorisation is × 9103. Divisors (6): 1, 2, 4, 9103, 18206, 36412.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36412 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36412 is composite. Its prime factorisation is
- 3
The divisors add up to 63728; without 36412 itself that is 27316, so 36412 is deficient (27316 is less than 36412). Euler's totient φ(36412) = 18204 numbers up to 36412 share no factor with it.
- 4
The digits of 36412 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 186 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36412 = 2^{2} \times 9103 \]36412 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 63728 |
| Euler totient φ(n) | 18204 |
| Square | 1325833744 |
| Cube | 48276258286528 |
| Square root | 190.819286 (= 2√9103) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 186 |
| Scientific notation | 3.6412 × |
36412 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand four hundred and twelve |
| Binary (base 2) | 1000111000111100 |
| Octal (base 8) | 107074 |
| Hexadecimal (base 16) | 8E3C |
| Base 3 | 1211221121 |
| As time | 36412 seconds = 10 h 6 min 52 s |
Is 36412 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36412 ÷ 2 = 18206) | 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 | Yes (36412 ÷ 4 = 9103) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36412 a prime number?
No. 36412 = × 9103, so it is divisible by 2.
What are the factors of 36412?
1, 2, 4, 9103, 18206, 36412.
What is 36412 in binary?
1000111000111100 (hexadecimal 8E3C, octal 107074).
What is the square root of 36412?
About 190.8193, exactly 2√9103.
Is 36412 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 36412?
It is a composite number with 6 divisors.