The number 5064
5064 is a composite number with 16 divisors. Its prime factorisation is × 3 × 211. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 211, 422, 633, 844, 1266, 1688, 2532, 5064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5064 is composite. Its prime factorisation is
- 3
The divisors add up to 12720; without 5064 itself that is 7656, so 5064 is abundant (7656 is more than 5064). Euler's totient φ(5064) = 1680 numbers up to 5064 share no factor with it.
- 4
The digits of 5064 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 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5064 = 2^{3} \times 3 \times 211 \]5064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12720 |
| Euler totient φ(n) | 1680 |
| Square | 25644096 |
| Cube | 129861702144 |
| Square root | 71.161787 (= 2√1266) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 33 |
| Scientific notation | 5.064 × |
5064 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty-four |
| Binary (base 2) | 1001111001000 |
| Octal (base 8) | 11710 |
| Hexadecimal (base 16) | 13C8 |
| Base 3 | 20221120 |
| As time | 5064 seconds = 1 h 24 min 24 s |
Is 5064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5064 ÷ 2 = 2532) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5064 ÷ 3 = 1688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5064 ÷ 4 = 1266) | 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 | Yes (5064 ÷ 6 = 844) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (5064 ÷ 8 = 633) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5064 ÷ 12 = 422) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5064 a prime number?
No. 5064 = × 3 × 211, so it is divisible by 2.
What are the factors of 5064?
1, 2, 3, 4, 6, 8, 12, 24, 211, 422, 633, 844, 1266, 1688, 2532, 5064.
What is 5064 in binary?
1001111001000 (hexadecimal 13C8, octal 11710).
What is the square root of 5064?
About 71.1618, exactly 2√1266.
Is 5064 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5064?
It is a composite number with 16 divisors.