The number 51051
51051 is a composite number with 32 divisors. Its prime factorisation is 3 × 7 × 11 × 13 × 17. Divisors (32): 1, 3, 7, 11, 13, 17, 21, 33, 39, 51, 77, 91, 119, 143, 187, 221 … 51051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51051 is composite. Its prime factorisation is
- 3
The divisors add up to 96768; without 51051 itself that is 45717, so 51051 is deficient (45717 is less than 51051). Euler's totient φ(51051) = 23040 numbers up to 51051 share no factor with it.
- 4
The digits of 51051 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51051 = 3 \times 7 \times 11 \times 13 \times 17 \]
51051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 96768 |
| Euler totient φ(n) | 23040 |
| Square | 2606204601 |
| Cube | 133049351085651 |
| Square root | 225.944683 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1051 × |
51051 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and fifty-one |
| Binary (base 2) | 1100011101101011 |
| Octal (base 8) | 143553 |
| Hexadecimal (base 16) | C76B |
| Base 3 | 2121000210 |
| As time | 51051 seconds = 14 h 10 min 51 s |
Is 51051 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 | Yes (51051 ÷ 3 = 17017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51051 ÷ 7 = 7293) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 (51051 ÷ 11 = 4641) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51051 a prime number?
No. 51051 = 3 × 7 × 11 × 13 × 17, so it is divisible by 3.
What are the factors of 51051?
1, 3, 7, 11, 13, 17, 21, 33, 39, 51, 77, 91, 119, 143, 187, 221, 231, 273, 357, 429, 561, 663, 1001, 1309, 1547, 2431, 3003, 3927, 4641, 7293, 17017, 51051.
What is 51051 in binary?
1100011101101011 (hexadecimal C76B, octal 143553).
What is the square root of 51051?
About 225.9447.
Is 51051 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51051?
It is a composite number with 32 divisors.