The number 9130
9130 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 83. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 83, 110, 166, 415, 830, 913, 1826, 4565, 9130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9130: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
9130 is composite. Its prime factorisation is
- 3
The divisors add up to 18144; without 9130 itself that is 9014, so 9130 is deficient (9014 is less than 9130). Euler's totient φ(9130) = 3280 numbers up to 9130 share no factor with it.
- 4
The digits of 9130 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9130 = 2 \times 5 \times 11 \times 83 \]
9130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 18144 |
| Euler totient φ(n) | 3280 |
| Square | 83356900 |
| Cube | 761048497000 |
| Square root | 95.551033 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 9.13 × |
9130 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirty |
| Binary (base 2) | 10001110101010 |
| Octal (base 8) | 21652 |
| Hexadecimal (base 16) | 23AA |
| Base 3 | 110112011 |
| As time | 9130 seconds = 2 h 32 min 10 s |
Is 9130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9130 ÷ 2 = 4565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (9130 ÷ 5 = 1826) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9130 ÷ 10 = 913) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (9130 ÷ 11 = 830) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9130 a prime number?
No. 9130 = 2 × 5 × 11 × 83, so it is divisible by 2.
What are the factors of 9130?
1, 2, 5, 10, 11, 22, 55, 83, 110, 166, 415, 830, 913, 1826, 4565, 9130.
What is 9130 in binary?
10001110101010 (hexadecimal 23AA, octal 21652).
What is the square root of 9130?
About 95.5510.
Is 9130 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 9130?
9130 is a happy number: repeatedly adding the squares of its digits reaches 1.