The number 51009
51009 is a composite number with 12 divisors. Its prime factorisation is 3 × × 347. Divisors (12): 1, 3, 7, 21, 49, 147, 347, 1041, 2429, 7287, 17003, 51009.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51009 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51009 is composite. Its prime factorisation is
- 3
The divisors add up to 79344; without 51009 itself that is 28335, so 51009 is deficient (28335 is less than 51009). Euler's totient φ(51009) = 29064 numbers up to 51009 share no factor with it.
- 4
The digits of 51009 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51009 = 3 \times 7^{2} \times 347 \]51009 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79344 |
| Euler totient φ(n) | 29064 |
| Square | 2601918081 |
| Cube | 132721239393729 |
| Square root | 225.851721 (= 7√1041) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1009 × |
51009 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and nine |
| Binary (base 2) | 1100011101000001 |
| Octal (base 8) | 143501 |
| Hexadecimal (base 16) | C741 |
| Base 3 | 2120222020 |
| As time | 51009 seconds = 14 h 10 min 9 s |
Is 51009 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 (51009 ÷ 3 = 17003) | 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 4) | 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 (51009 ÷ 7 = 7287) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51009 a prime number?
No. 51009 = 3 × × 347, so it is divisible by 3.
What are the factors of 51009?
1, 3, 7, 21, 49, 147, 347, 1041, 2429, 7287, 17003, 51009.
What is 51009 in binary?
1100011101000001 (hexadecimal C741, octal 143501).
What is the square root of 51009?
About 225.8517, exactly 7√1041.
Is 51009 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51009?
It is a composite number with 12 divisors.