The number 9061
9061 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 41. Divisors (8): 1, 13, 17, 41, 221, 533, 697, 9061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9061 is composite. Its prime factorisation is
- 3
The divisors add up to 10584; without 9061 itself that is 1523, so 9061 is deficient (1523 is less than 9061). Euler's totient φ(9061) = 7680 numbers up to 9061 share no factor with it.
- 4
The digits of 9061 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9061 = 13 \times 17 \times 41 \]
9061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10584 |
| Euler totient φ(n) | 7680 |
| Square | 82101721 |
| Cube | 743923693981 |
| Square root | 95.189285 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 9.061 × |
9061 in other forms
| Form | Value |
|---|---|
| In words | nine thousand and sixty-one |
| Binary (base 2) | 10001101100101 |
| Octal (base 8) | 21545 |
| Hexadecimal (base 16) | 2365 |
| Base 3 | 110102121 |
| As time | 9061 seconds = 2 h 31 min 1 s |
Is 9061 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9061 a prime number?
No. 9061 = 13 × 17 × 41, so it is divisible by 13.
What are the factors of 9061?
1, 13, 17, 41, 221, 533, 697, 9061.
What is 9061 in binary?
10001101100101 (hexadecimal 2365, octal 21545).
What is the square root of 9061?
About 95.1893.
Is 9061 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 9061?
It is a composite number with 8 divisors.