The number 5369
5369 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 59. Divisors (8): 1, 7, 13, 59, 91, 413, 767, 5369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5369 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5369 is composite. Its prime factorisation is
- 3
The divisors add up to 6720; without 5369 itself that is 1351, so 5369 is deficient (1351 is less than 5369). Euler's totient φ(5369) = 4176 numbers up to 5369 share no factor with it.
- 4
The digits of 5369 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5369 = 7 \times 13 \times 59 \]
5369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6720 |
| Euler totient φ(n) | 4176 |
| Square | 28826161 |
| Cube | 154767658409 |
| Square root | 73.273460 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 72 |
| Scientific notation | 5.369 × |
5369 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and sixty-nine |
| Binary (base 2) | 1010011111001 |
| Octal (base 8) | 12371 |
| Hexadecimal (base 16) | 14F9 |
| Base 3 | 21100212 |
| As time | 5369 seconds = 1 h 29 min 29 s |
Is 5369 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5369 ÷ 7 = 767) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5369 a prime number?
No. 5369 = 7 × 13 × 59, so it is divisible by 7.
What are the factors of 5369?
1, 7, 13, 59, 91, 413, 767, 5369.
What is 5369 in binary?
1010011111001 (hexadecimal 14F9, octal 12371).
What is the square root of 5369?
About 73.2735.
Is 5369 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 5369?
It is a composite number with 8 divisors.