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