The number 53461
53461 is a composite number with 4 divisors. Its prime factorisation is 193 × 277. Divisors (4): 1, 193, 277, 53461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53461: a semiprime: 193 × 277, the product of two primes.
- 2
53461 is composite. Its prime factorisation is
- 3
The divisors add up to 53932; without 53461 itself that is 471, so 53461 is deficient (471 is less than 53461). Euler's totient φ(53461) = 52992 numbers up to 53461 share no factor with it.
- 4
The digits of 53461 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53461 = 193 \times 277 \]
53461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53932 |
| Euler totient φ(n) | 52992 |
| Square | 2858078521 |
| Cube | 152795735811181 |
| Square root | 231.216349 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3461 × |
53461 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and sixty-one |
| Binary (base 2) | 1101000011010101 |
| Octal (base 8) | 150325 |
| Hexadecimal (base 16) | D0D5 |
| Base 3 | 2201100001 |
| As time | 53461 seconds = 14 h 51 min 1 s |
Is 53461 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53461 a prime number?
No. 53461 = 193 × 277, so it is divisible by 193.
What are the factors of 53461?
1, 193, 277, 53461.
What is 53461 in binary?
1101000011010101 (hexadecimal D0D5, octal 150325).
What is the square root of 53461?
About 231.2163.
Is 53461 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53461?
53461 is a semiprime: 193 × 277, the product of two primes.