The number 9436
9436 is a composite number with 12 divisors. Its prime factorisation is × 7 × 337. Divisors (12): 1, 2, 4, 7, 14, 28, 337, 674, 1348, 2359, 4718, 9436.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9436 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9436 is composite. Its prime factorisation is
- 3
The divisors add up to 18928; without 9436 itself that is 9492, so 9436 is abundant (9492 is more than 9436). Euler's totient φ(9436) = 4032 numbers up to 9436 share no factor with it.
- 4
The digits of 9436 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9436 = 2^{2} \times 7 \times 337 \]9436 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 18928 |
| Euler totient φ(n) | 4032 |
| Square | 89038096 |
| Cube | 840163473856 |
| Square root | 97.139076 (= 2√2359) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.436 × |
9436 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and thirty-six |
| Binary (base 2) | 10010011011100 |
| Octal (base 8) | 22334 |
| Hexadecimal (base 16) | 24DC |
| Base 3 | 110221111 |
| As time | 9436 seconds = 2 h 37 min 16 s |
Is 9436 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9436 ÷ 2 = 4718) | 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 (9436 ÷ 4 = 2359) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (9436 ÷ 7 = 1348) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 9436 a prime number?
No. 9436 = × 7 × 337, so it is divisible by 2.
What are the factors of 9436?
1, 2, 4, 7, 14, 28, 337, 674, 1348, 2359, 4718, 9436.
What is 9436 in binary?
10010011011100 (hexadecimal 24DC, octal 22334).
What is the square root of 9436?
About 97.1391, exactly 2√2359.
Is 9436 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 9436?
It is a composite number with 12 divisors.