The number 9150
9150 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 61. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 61, 75, 122, 150, 183, 305 … 9150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9150: a Harshad number: divisible by its digit sum 15.
- 2
9150 is composite. Its prime factorisation is
- 3
The divisors add up to 23064; without 9150 itself that is 13914, so 9150 is abundant (13914 is more than 9150). Euler's totient φ(9150) = 2400 numbers up to 9150 share no factor with it.
- 4
The digits of 9150 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9150 = 2 \times 3 \times 5^{2} \times 61 \]9150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 23064 |
| Euler totient φ(n) | 2400 |
| Square | 83722500 |
| Cube | 766060875000 |
| Square root | 95.655632 (= 5√366) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.15 × |
9150 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty |
| Binary (base 2) | 10001110111110 |
| Octal (base 8) | 21676 |
| Hexadecimal (base 16) | 23BE |
| Base 3 | 110112220 |
| As time | 9150 seconds = 2 h 32 min 30 s |
Is 9150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9150 ÷ 2 = 4575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9150 ÷ 3 = 3050) | 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 (9150 ÷ 5 = 1830) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9150 ÷ 6 = 1525) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9150 ÷ 10 = 915) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9150 a prime number?
No. 9150 = 2 × 3 × × 61, so it is divisible by 2.
What are the factors of 9150?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 61, 75, 122, 150, 183, 305, 366, 610, 915, 1525, 1830, 3050, 4575, 9150.
What is 9150 in binary?
10001110111110 (hexadecimal 23BE, octal 21676).
What is the square root of 9150?
About 95.6556, exactly 5√366.
Is 9150 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 9150?
9150 is a Harshad number: divisible by its digit sum 15.