The number 9132
9132 is a composite number with 12 divisors. Its prime factorisation is × 3 × 761. Divisors (12): 1, 2, 3, 4, 6, 12, 761, 1522, 2283, 3044, 4566, 9132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9132 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9132 is composite. Its prime factorisation is
- 3
The divisors add up to 21336; without 9132 itself that is 12204, so 9132 is abundant (12204 is more than 9132). Euler's totient φ(9132) = 3040 numbers up to 9132 share no factor with it.
- 4
The digits of 9132 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9132 = 2^{2} \times 3 \times 761 \]9132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 21336 |
| Euler totient φ(n) | 3040 |
| Square | 83393424 |
| Cube | 761548747968 |
| Square root | 95.561499 (= 2√2283) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.132 × |
9132 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirty-two |
| Binary (base 2) | 10001110101100 |
| Octal (base 8) | 21654 |
| Hexadecimal (base 16) | 23AC |
| Base 3 | 110112020 |
| As time | 9132 seconds = 2 h 32 min 12 s |
Is 9132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9132 ÷ 2 = 4566) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9132 ÷ 3 = 3044) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (9132 ÷ 4 = 2283) | 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 | Yes (9132 ÷ 6 = 1522) | 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 6) | 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 | Yes (9132 ÷ 12 = 761) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9132 a prime number?
No. 9132 = × 3 × 761, so it is divisible by 2.
What are the factors of 9132?
1, 2, 3, 4, 6, 12, 761, 1522, 2283, 3044, 4566, 9132.
What is 9132 in binary?
10001110101100 (hexadecimal 23AC, octal 21654).
What is the square root of 9132?
About 95.5615, exactly 2√2283.
Is 9132 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 9132?
It is a composite number with 12 divisors.