The number 51601
51601 is a composite number with 4 divisors. Its prime factorisation is 11 × 4691. Divisors (4): 1, 11, 4691, 51601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51601: a semiprime: 11 × 4691, the product of two primes.
- 2
51601 is composite. Its prime factorisation is
- 3
The divisors add up to 56304; without 51601 itself that is 4703, so 51601 is deficient (4703 is less than 51601). Euler's totient φ(51601) = 46900 numbers up to 51601 share no factor with it.
- 4
The digits of 51601 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51601 = 11 \times 4691 \]
51601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56304 |
| Euler totient φ(n) | 46900 |
| Square | 2662663201 |
| Cube | 137396083834801 |
| Square root | 227.158535 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1601 × |
51601 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and one |
| Binary (base 2) | 1100100110010001 |
| Octal (base 8) | 144621 |
| Hexadecimal (base 16) | C991 |
| Base 3 | 2121210011 |
| As time | 51601 seconds = 14 h 20 min 1 s |
Is 51601 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (51601 ÷ 11 = 4691) | 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 51601 a prime number?
No. 51601 = 11 × 4691, so it is divisible by 11.
What are the factors of 51601?
1, 11, 4691, 51601.
What is 51601 in binary?
1100100110010001 (hexadecimal C991, octal 144621).
What is the square root of 51601?
About 227.1585.
Is 51601 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51601?
51601 is a semiprime: 11 × 4691, the product of two primes.