The number 9270
9270 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 103. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 103, 206, 309, 515 … 9270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9270: a Harshad number: divisible by its digit sum 18.
- 2
9270 is composite. Its prime factorisation is
- 3
The divisors add up to 24336; without 9270 itself that is 15066, so 9270 is abundant (15066 is more than 9270). Euler's totient φ(9270) = 2448 numbers up to 9270 share no factor with it.
- 4
The digits of 9270 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9270 = 2 \times 3^{2} \times 5 \times 103 \]9270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 24336 |
| Euler totient φ(n) | 2448 |
| Square | 85932900 |
| Cube | 796597983000 |
| Square root | 96.280839 (= 3√1030) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 9.27 × |
9270 in other forms
| Form | Value |
|---|---|
| In words | nine thousand two hundred and seventy |
| Binary (base 2) | 10010000110110 |
| Octal (base 8) | 22066 |
| Hexadecimal (base 16) | 2436 |
| Base 3 | 110201100 |
| As time | 9270 seconds = 2 h 34 min 30 s |
Is 9270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9270 ÷ 2 = 4635) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9270 ÷ 3 = 3090) | 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 | Yes (9270 ÷ 5 = 1854) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9270 ÷ 6 = 1545) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (9270 ÷ 9 = 1030) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9270 ÷ 10 = 927) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9270 a prime number?
No. 9270 = 2 × × 5 × 103, so it is divisible by 2.
What are the factors of 9270?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 103, 206, 309, 515, 618, 927, 1030, 1545, 1854, 3090, 4635, 9270.
What is 9270 in binary?
10010000110110 (hexadecimal 2436, octal 22066).
What is the square root of 9270?
About 96.2808, exactly 3√1030.
Is 9270 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 9270?
9270 is a Harshad number: divisible by its digit sum 18.