The number 51041
51041 is a composite number with 4 divisors. Its prime factorisation is 43 × 1187. Divisors (4): 1, 43, 1187, 51041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51041: a semiprime: 43 × 1187, the product of two primes.
- 2
51041 is composite. Its prime factorisation is
- 3
The divisors add up to 52272; without 51041 itself that is 1231, so 51041 is deficient (1231 is less than 51041). Euler's totient φ(51041) = 49812 numbers up to 51041 share no factor with it.
- 4
The digits of 51041 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51041 = 43 \times 1187 \]
51041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52272 |
| Euler totient φ(n) | 49812 |
| Square | 2605183681 |
| Cube | 132971180261921 |
| Square root | 225.922553 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.1041 × |
51041 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and forty-one |
| Binary (base 2) | 1100011101100001 |
| Octal (base 8) | 143541 |
| Hexadecimal (base 16) | C761 |
| Base 3 | 2121000102 |
| As time | 51041 seconds = 14 h 10 min 41 s |
Is 51041 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 1) | 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 1) | 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 51041 a prime number?
No. 51041 = 43 × 1187, so it is divisible by 43.
What are the factors of 51041?
1, 43, 1187, 51041.
What is 51041 in binary?
1100011101100001 (hexadecimal C761, octal 143541).
What is the square root of 51041?
About 225.9226.
Is 51041 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51041?
51041 is a semiprime: 43 × 1187, the product of two primes.