The number 9156
9156 is a composite number with 24 divisors. Its prime factorisation is × 3 × 7 × 109. Divisors (24): 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 109, 218, 327, 436 … 9156.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9156: a Harshad number: divisible by its digit sum 21.
- 2
9156 is composite. Its prime factorisation is
- 3
The divisors add up to 24640; without 9156 itself that is 15484, so 9156 is abundant (15484 is more than 9156). Euler's totient φ(9156) = 2592 numbers up to 9156 share no factor with it.
- 4
The digits of 9156 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9156 = 2^{2} \times 3 \times 7 \times 109 \]9156 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 24640 |
| Euler totient φ(n) | 2592 |
| Square | 83832336 |
| Cube | 767568868416 |
| Square root | 95.686990 (= 2√2289) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.156 × |
9156 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty-six |
| Binary (base 2) | 10001111000100 |
| Octal (base 8) | 21704 |
| Hexadecimal (base 16) | 23C4 |
| Base 3 | 110120010 |
| As time | 9156 seconds = 2 h 32 min 36 s |
Is 9156 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9156 ÷ 2 = 4578) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9156 ÷ 3 = 3052) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (9156 ÷ 4 = 2289) | 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 | Yes (9156 ÷ 6 = 1526) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (9156 ÷ 7 = 1308) | 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (9156 ÷ 12 = 763) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9156 a prime number?
No. 9156 = × 3 × 7 × 109, so it is divisible by 2.
What are the factors of 9156?
1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 109, 218, 327, 436, 654, 763, 1308, 1526, 2289, 3052, 4578, 9156.
What is 9156 in binary?
10001111000100 (hexadecimal 23C4, octal 21704).
What is the square root of 9156?
About 95.6870, exactly 2√2289.
Is 9156 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9156?
9156 is a Harshad number: divisible by its digit sum 21.