The number 51004
51004 is a composite number with 12 divisors. Its prime factorisation is × 41 × 311. Divisors (12): 1, 2, 4, 41, 82, 164, 311, 622, 1244, 12751, 25502, 51004.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51004 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51004 is composite. Its prime factorisation is
- 3
The divisors add up to 91728; without 51004 itself that is 40724, so 51004 is deficient (40724 is less than 51004). Euler's totient φ(51004) = 24800 numbers up to 51004 share no factor with it.
- 4
The digits of 51004 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51004 = 2^{2} \times 41 \times 311 \]51004 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91728 |
| Euler totient φ(n) | 24800 |
| Square | 2601408016 |
| Cube | 132682214448064 |
| Square root | 225.840652 (= 2√12751) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1004 × |
51004 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and four |
| Binary (base 2) | 1100011100111100 |
| Octal (base 8) | 143474 |
| Hexadecimal (base 16) | C73C |
| Base 3 | 2120222001 |
| As time | 51004 seconds = 14 h 10 min 4 s |
Is 51004 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51004 ÷ 2 = 25502) | 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 | Yes (51004 ÷ 4 = 12751) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51004 a prime number?
No. 51004 = × 41 × 311, so it is divisible by 2.
What are the factors of 51004?
1, 2, 4, 41, 82, 164, 311, 622, 1244, 12751, 25502, 51004.
What is 51004 in binary?
1100011100111100 (hexadecimal C73C, octal 143474).
What is the square root of 51004?
About 225.8407, exactly 2√12751.
Is 51004 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51004?
It is a composite number with 12 divisors.