The number 9146
9146 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 269. Divisors (8): 1, 2, 17, 34, 269, 538, 4573, 9146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9146 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9146 is composite. Its prime factorisation is
- 3
The divisors add up to 14580; without 9146 itself that is 5434, so 9146 is deficient (5434 is less than 9146). Euler's totient φ(9146) = 4288 numbers up to 9146 share no factor with it.
- 4
The digits of 9146 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9146 = 2 \times 17 \times 269 \]
9146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14580 |
| Euler totient φ(n) | 4288 |
| Square | 83649316 |
| Cube | 765056644136 |
| Square root | 95.634722 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 34 |
| Scientific notation | 9.146 × |
9146 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and forty-six |
| Binary (base 2) | 10001110111010 |
| Octal (base 8) | 21672 |
| Hexadecimal (base 16) | 23BA |
| Base 3 | 110112202 |
| As time | 9146 seconds = 2 h 32 min 26 s |
Is 9146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9146 ÷ 2 = 4573) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9146 a prime number?
No. 9146 = 2 × 17 × 269, so it is divisible by 2.
What are the factors of 9146?
1, 2, 17, 34, 269, 538, 4573, 9146.
What is 9146 in binary?
10001110111010 (hexadecimal 23BA, octal 21672).
What is the square root of 9146?
About 95.6347.
Is 9146 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 9146?
It is a composite number with 8 divisors.