The number 5367
5367 is a composite number with 4 divisors. Its prime factorisation is 3 × 1789. Divisors (4): 1, 3, 1789, 5367.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5367: a semiprime: 3 × 1789, the product of two primes.
- 2
5367 is composite. Its prime factorisation is
- 3
The divisors add up to 7160; without 5367 itself that is 1793, so 5367 is deficient (1793 is less than 5367). Euler's totient φ(5367) = 3576 numbers up to 5367 share no factor with it.
- 4
The digits of 5367 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5367 = 3 \times 1789 \]
5367 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7160 |
| Euler totient φ(n) | 3576 |
| Square | 28804689 |
| Cube | 154594765863 |
| Square root | 73.259812 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 72 |
| Scientific notation | 5.367 × |
5367 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and sixty-seven |
| Binary (base 2) | 1010011110111 |
| Octal (base 8) | 12367 |
| Hexadecimal (base 16) | 14F7 |
| Base 3 | 21100210 |
| As time | 5367 seconds = 1 h 29 min 27 s |
Is 5367 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 | Yes (5367 ÷ 3 = 1789) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5367 a prime number?
No. 5367 = 3 × 1789, so it is divisible by 3.
What are the factors of 5367?
1, 3, 1789, 5367.
What is 5367 in binary?
1010011110111 (hexadecimal 14F7, octal 12367).
What is the square root of 5367?
About 73.2598.
Is 5367 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5367?
5367 is a semiprime: 3 × 1789, the product of two primes.