The number 5368
5368 is a composite number with 16 divisors. Its prime factorisation is × 11 × 61. Divisors (16): 1, 2, 4, 8, 11, 22, 44, 61, 88, 122, 244, 488, 671, 1342, 2684, 5368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5368: a Harshad number: divisible by its digit sum 22.
- 2
5368 is composite. Its prime factorisation is
- 3
The divisors add up to 11160; without 5368 itself that is 5792, so 5368 is abundant (5792 is more than 5368). Euler's totient φ(5368) = 2400 numbers up to 5368 share no factor with it.
- 4
The digits of 5368 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5368 = 2^{3} \times 11 \times 61 \]5368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 11160 |
| Euler totient φ(n) | 2400 |
| Square | 28815424 |
| Cube | 154681196032 |
| Square root | 73.266636 (= 2√1342) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.368 × |
5368 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and sixty-eight |
| Binary (base 2) | 1010011111000 |
| Octal (base 8) | 12370 |
| Hexadecimal (base 16) | 14F8 |
| Base 3 | 21100211 |
| As time | 5368 seconds = 1 h 29 min 28 s |
Is 5368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5368 ÷ 2 = 2684) | 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 (5368 ÷ 4 = 1342) | 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 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 (5368 ÷ 8 = 671) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (5368 ÷ 11 = 488) | 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 5368 a prime number?
No. 5368 = × 11 × 61, so it is divisible by 2.
What are the factors of 5368?
1, 2, 4, 8, 11, 22, 44, 61, 88, 122, 244, 488, 671, 1342, 2684, 5368.
What is 5368 in binary?
1010011111000 (hexadecimal 14F8, octal 12370).
What is the square root of 5368?
About 73.2666, exactly 2√1342.
Is 5368 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5368?
5368 is a Harshad number: divisible by its digit sum 22.