The number 9461
9461 is a twin prime (9461 and 9463 are both prime) and the 1171st prime number. Its only divisors are 1 and 9461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9461: a twin prime (9461 and 9463 are both prime); the 1171st prime number.
- 2
9461 is prime, so its only factors are 1 and 9461. It is the 1171st prime; the next prime is 9463 and the one before is 9439.
- 3
The divisors add up to 9462; without 9461 itself that is 1, so 9461 is deficient (1 is less than 9461). Euler's totient φ(9461) = 9460 numbers up to 9461 share no factor with it.
- 4
The digits of 9461 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
9461 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 9462 |
| Euler totient φ(n) | 9460 |
| Square | 89510521 |
| Cube | 846859039181 |
| Square root | 97.267672 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.461 × |
9461 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and sixty-one |
| Binary (base 2) | 10010011110101 |
| Octal (base 8) | 22365 |
| Hexadecimal (base 16) | 24F5 |
| Base 3 | 110222102 |
| As time | 9461 seconds = 2 h 37 min 41 s |
Is 9461 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9461 a prime number?
Yes. 9461 is divisible only by 1 and itself.
What are the factors of 9461?
1, 9461.
What is 9461 in binary?
10010011110101 (hexadecimal 24F5, octal 22365).
What is the square root of 9461?
About 97.2677.
Is 9461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 9461?
9461 is a twin prime (9461 and 9463 are both prime); the 1171st prime number.