The number 51641
51641 is a composite number with 4 divisors. Its prime factorisation is 113 × 457. Divisors (4): 1, 113, 457, 51641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51641: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 457, the product of two primes.
- 2
51641 is composite. Its prime factorisation is
- 3
The divisors add up to 52212; without 51641 itself that is 571, so 51641 is deficient (571 is less than 51641). Euler's totient φ(51641) = 51072 numbers up to 51641 share no factor with it.
- 4
The digits of 51641 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.
LaTeX source of the formulas on this page
\[ 51641 = 113 \times 457 \]
51641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52212 |
| Euler totient φ(n) | 51072 |
| Square | 2666792881 |
| Cube | 137715851167721 |
| Square root | 227.246562 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1641 × |
51641 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and forty-one |
| Binary (base 2) | 1100100110111001 |
| Octal (base 8) | 144671 |
| Hexadecimal (base 16) | C9B9 |
| Base 3 | 2121211122 |
| As time | 51641 seconds = 14 h 20 min 41 s |
Is 51641 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 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 1) | 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 7) | 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 51641 a prime number?
No. 51641 = 113 × 457, so it is divisible by 113.
What are the factors of 51641?
1, 113, 457, 51641.
What is 51641 in binary?
1100100110111001 (hexadecimal C9B9, octal 144671).
What is the square root of 51641?
About 227.2466.
Is 51641 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51641?
51641 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 457, the product of two primes.