The number 5464
5464 is a composite number with 8 divisors. Its prime factorisation is × 683. Divisors (8): 1, 2, 4, 8, 683, 1366, 2732, 5464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5464 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5464 is composite. Its prime factorisation is
- 3
The divisors add up to 10260; without 5464 itself that is 4796, so 5464 is deficient (4796 is less than 5464). Euler's totient φ(5464) = 2728 numbers up to 5464 share no factor with it.
- 4
The digits of 5464 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5464 = 2^{3} \times 683 \]5464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10260 |
| Euler totient φ(n) | 2728 |
| Square | 29855296 |
| Cube | 163129337344 |
| Square root | 73.918874 (= 2√1366) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.464 × |
5464 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and sixty-four |
| Binary (base 2) | 1010101011000 |
| Octal (base 8) | 12530 |
| Hexadecimal (base 16) | 1558 |
| Base 3 | 21111101 |
| As time | 5464 seconds = 1 h 31 min 4 s |
Is 5464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5464 ÷ 2 = 2732) | 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 (5464 ÷ 4 = 1366) | 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 4) | 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 (5464 ÷ 8 = 683) | 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 5464 a prime number?
No. 5464 = × 683, so it is divisible by 2.
What are the factors of 5464?
1, 2, 4, 8, 683, 1366, 2732, 5464.
What is 5464 in binary?
1010101011000 (hexadecimal 1558, octal 12530).
What is the square root of 5464?
About 73.9189, exactly 2√1366.
Is 5464 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5464?
It is a composite number with 8 divisors.