The number 51008
51008 is a composite number with 14 divisors. Its prime factorisation is × 797. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 797, 1594, 3188, 6376, 12752, 25504, 51008.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51008 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51008 is composite. Its prime factorisation is
- 3
The divisors add up to 101346; without 51008 itself that is 50338, so 51008 is deficient (50338 is less than 51008). Euler's totient φ(51008) = 25472 numbers up to 51008 share no factor with it.
- 4
The digits of 51008 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51008 = 2^{6} \times 797 \]51008 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 101346 |
| Euler totient φ(n) | 25472 |
| Square | 2601816064 |
| Cube | 132713433792512 |
| Square root | 225.849507 (= 8√797) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1008 × |
51008 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and eight |
| Binary (base 2) | 1100011101000000 |
| Octal (base 8) | 143500 |
| Hexadecimal (base 16) | C740 |
| Base 3 | 2120222012 |
| As time | 51008 seconds = 14 h 10 min 8 s |
Is 51008 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51008 ÷ 2 = 25504) | 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 | Yes (51008 ÷ 4 = 12752) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (51008 ÷ 8 = 6376) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51008 a prime number?
No. 51008 = × 797, so it is divisible by 2.
What are the factors of 51008?
1, 2, 4, 8, 16, 32, 64, 797, 1594, 3188, 6376, 12752, 25504, 51008.
What is 51008 in binary?
1100011101000000 (hexadecimal C740, octal 143500).
What is the square root of 51008?
About 225.8495, exactly 8√797.
Is 51008 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51008?
It is a composite number with 14 divisors.