The number 9147
9147 is a composite number with 4 divisors. Its prime factorisation is 3 × 3049. Divisors (4): 1, 3, 3049, 9147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9147: a semiprime: 3 × 3049, the product of two primes.
- 2
9147 is composite. Its prime factorisation is
- 3
The divisors add up to 12200; without 9147 itself that is 3053, so 9147 is deficient (3053 is less than 9147). Euler's totient φ(9147) = 6096 numbers up to 9147 share no factor with it.
- 4
The digits of 9147 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9147 = 3 \times 3049 \]
9147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12200 |
| Euler totient φ(n) | 6096 |
| Square | 83667609 |
| Cube | 765307619523 |
| Square root | 95.639950 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 9.147 × |
9147 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and forty-seven |
| Binary (base 2) | 10001110111011 |
| Octal (base 8) | 21673 |
| Hexadecimal (base 16) | 23BB |
| Base 3 | 110112210 |
| As time | 9147 seconds = 2 h 32 min 27 s |
Is 9147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9147 ÷ 3 = 3049) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9147 a prime number?
No. 9147 = 3 × 3049, so it is divisible by 3.
What are the factors of 9147?
1, 3, 3049, 9147.
What is 9147 in binary?
10001110111011 (hexadecimal 23BB, octal 21673).
What is the square root of 9147?
About 95.6399.
Is 9147 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9147?
9147 is a semiprime: 3 × 3049, the product of two primes.