The number 51461
51461 is the 5266th prime number. Its only divisors are 1 and 51461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51461: the 5266th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51461 is prime, so its only factors are 1 and 51461. It is the 5266th prime; the next prime is 51473 and the one before is 51449.
- 3
The divisors add up to 51462; without 51461 itself that is 1, so 51461 is deficient (1 is less than 51461). Euler's totient φ(51461) = 51460 numbers up to 51461 share no factor with it.
- 4
The digits of 51461 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
51461 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 51462 |
| Euler totient φ(n) | 51460 |
| Square | 2648234521 |
| Cube | 136280796685181 |
| Square root | 226.850171 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1461 × |
51461 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and sixty-one |
| Binary (base 2) | 1100100100000101 |
| Octal (base 8) | 144405 |
| Hexadecimal (base 16) | C905 |
| Base 3 | 2121120222 |
| As time | 51461 seconds = 14 h 17 min 41 s |
Is 51461 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 8) | 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 3) | 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 51461 a prime number?
Yes. 51461 is divisible only by 1 and itself.
What are the factors of 51461?
1, 51461.
What is 51461 in binary?
1100100100000101 (hexadecimal C905, octal 144405).
What is the square root of 51461?
About 226.8502.
Is 51461 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51461?
51461 is the 5266th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.