The number 461
461 is a twin prime (461 and 463 are both prime) and the 89th prime number. Its only divisors are 1 and 461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 461: a twin prime (461 and 463 are both prime); the 89th prime number.
- 2
461 is prime, so its only factors are 1 and 461. It is the 89th prime; the next prime is 463 and the one before is 457.
- 3
The divisors add up to 462; without 461 itself that is 1, so 461 is deficient (1 is less than 461). Euler's totient φ(461) = 460 numbers up to 461 share no factor with it.
- 4
The digits of 461 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 35 steps to reach 1.
461 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 462 |
| Euler totient φ(n) | 460 |
| Square | 212521 |
| Cube | 97972181 |
| Square root | 21.470911 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 35 |
| Scientific notation | 4.61 × |
461 in other forms
| Form | Value |
|---|---|
| In words | four hundred and sixty-one |
| Roman numerals | CDLXI |
| Binary (base 2) | 111001101 |
| Octal (base 8) | 715 |
| Hexadecimal (base 16) | 1CD |
| Base 3 | 122002 |
| As time | 461 seconds = 7 min 41 s |
Is 461 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 6) | 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 10) | 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 461 a prime number?
Yes. 461 is divisible only by 1 and itself.
What are the factors of 461?
1, 461.
What is 461 in binary?
111001101 (hexadecimal 1CD, octal 715).
What is the square root of 461?
About 21.4709.
What is 461 in Roman numerals?
CDLXI.
Is 461 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 461?
461 is a twin prime (461 and 463 are both prime); the 89th prime number.