The number 51064
51064 is a composite number with 16 divisors. Its prime factorisation is × 13 × 491. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 491, 982, 1964, 3928, 6383, 12766, 25532, 51064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51064 is composite. Its prime factorisation is
- 3
The divisors add up to 103320; without 51064 itself that is 52256, so 51064 is abundant (52256 is more than 51064). Euler's totient φ(51064) = 23520 numbers up to 51064 share no factor with it.
- 4
The digits of 51064 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51064 = 2^{3} \times 13 \times 491 \]51064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103320 |
| Euler totient φ(n) | 23520 |
| Square | 2607532096 |
| Cube | 133151018950144 |
| Square root | 225.973450 (= 2√12766) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1064 × |
51064 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and sixty-four |
| Binary (base 2) | 1100011101111000 |
| Octal (base 8) | 143570 |
| Hexadecimal (base 16) | C778 |
| Base 3 | 2121001021 |
| As time | 51064 seconds = 14 h 11 min 4 s |
Is 51064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51064 ÷ 2 = 25532) | 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 (51064 ÷ 4 = 12766) | 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 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 (51064 ÷ 8 = 6383) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 2) | 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 51064 a prime number?
No. 51064 = × 13 × 491, so it is divisible by 2.
What are the factors of 51064?
1, 2, 4, 8, 13, 26, 52, 104, 491, 982, 1964, 3928, 6383, 12766, 25532, 51064.
What is 51064 in binary?
1100011101111000 (hexadecimal C778, octal 143570).
What is the square root of 51064?
About 225.9734, exactly 2√12766.
Is 51064 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51064?
It is a composite number with 16 divisors.