The number 9260
9260 is a composite number with 12 divisors. Its prime factorisation is × 5 × 463. Divisors (12): 1, 2, 4, 5, 10, 20, 463, 926, 1852, 2315, 4630, 9260.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9260 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9260 is composite. Its prime factorisation is
- 3
The divisors add up to 19488; without 9260 itself that is 10228, so 9260 is abundant (10228 is more than 9260). Euler's totient φ(9260) = 3696 numbers up to 9260 share no factor with it.
- 4
The digits of 9260 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9260 = 2^{2} \times 5 \times 463 \]9260 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19488 |
| Euler totient φ(n) | 3696 |
| Square | 85747600 |
| Cube | 794022776000 |
| Square root | 96.228894 (= 2√2315) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.26 × |
9260 in other forms
| Form | Value |
|---|---|
| In words | nine thousand two hundred and sixty |
| Binary (base 2) | 10010000101100 |
| Octal (base 8) | 22054 |
| Hexadecimal (base 16) | 242C |
| Base 3 | 110200222 |
| As time | 9260 seconds = 2 h 34 min 20 s |
Is 9260 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9260 ÷ 2 = 4630) | 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 | Yes (9260 ÷ 4 = 2315) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (9260 ÷ 5 = 1852) | 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 6) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9260 ÷ 10 = 926) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9260 a prime number?
No. 9260 = × 5 × 463, so it is divisible by 2.
What are the factors of 9260?
1, 2, 4, 5, 10, 20, 463, 926, 1852, 2315, 4630, 9260.
What is 9260 in binary?
10010000101100 (hexadecimal 242C, octal 22054).
What is the square root of 9260?
About 96.2289, exactly 2√2315.
Is 9260 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 9260?
It is a composite number with 12 divisors.