The number 5364
5364 is a composite number with 18 divisors. Its prime factorisation is × × 149. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 149, 298, 447, 596, 894, 1341, 1788 … 5364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5364: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
5364 is composite. Its prime factorisation is
- 3
The divisors add up to 13650; without 5364 itself that is 8286, so 5364 is abundant (8286 is more than 5364). Euler's totient φ(5364) = 1776 numbers up to 5364 share no factor with it.
- 4
The digits of 5364 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5364 = 2^{2} \times 3^{2} \times 149 \]5364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 13650 |
| Euler totient φ(n) | 1776 |
| Square | 28772496 |
| Cube | 154335668544 |
| Square root | 73.239334 (= 6√149) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 72 |
| Scientific notation | 5.364 × |
5364 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and sixty-four |
| Binary (base 2) | 1010011110100 |
| Octal (base 8) | 12364 |
| Hexadecimal (base 16) | 14F4 |
| Base 3 | 21100200 |
| As time | 5364 seconds = 1 h 29 min 24 s |
Is 5364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5364 ÷ 2 = 2682) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5364 ÷ 3 = 1788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5364 ÷ 4 = 1341) | 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 (5364 ÷ 6 = 894) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5364 ÷ 9 = 596) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5364 ÷ 12 = 447) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5364 a prime number?
No. 5364 = × × 149, so it is divisible by 2.
What are the factors of 5364?
1, 2, 3, 4, 6, 9, 12, 18, 36, 149, 298, 447, 596, 894, 1341, 1788, 2682, 5364.
What is 5364 in binary?
1010011110100 (hexadecimal 14F4, octal 12364).
What is the square root of 5364?
About 73.2393, exactly 6√149.
Is 5364 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5364?
5364 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.