The number 1360
1360 is a composite number with 20 divisors. Its prime factorisation is × 5 × 17. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 17, 20, 34, 40, 68, 80, 85, 136, 170 … 1360.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1360: a Harshad number: divisible by its digit sum 10.
- 2
1360 is composite. Its prime factorisation is
- 3
The divisors add up to 3348; without 1360 itself that is 1988, so 1360 is abundant (1988 is more than 1360). Euler's totient φ(1360) = 512 numbers up to 1360 share no factor with it.
- 4
The digits of 1360 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 13 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1360 = 2^{4} \times 5 \times 17 \]1360 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 3348 |
| Euler totient φ(n) | 512 |
| Square | 1849600 |
| Cube | 2515456000 |
| Square root | 36.878178 (= 4√85) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 13 |
| Scientific notation | 1.36 × |
1360 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and sixty |
| Roman numerals | MCCCLX |
| Binary (base 2) | 10101010000 |
| Octal (base 8) | 2520 |
| Hexadecimal (base 16) | 550 |
| Base 3 | 1212101 |
| As time | 1360 seconds = 22 min 40 s |
Is 1360 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1360 ÷ 2 = 680) | 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 (1360 ÷ 4 = 340) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1360 ÷ 5 = 272) | 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 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 | Yes (1360 ÷ 8 = 170) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1360 ÷ 10 = 136) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1360 a prime number?
No. 1360 = × 5 × 17, so it is divisible by 2.
What are the factors of 1360?
1, 2, 4, 5, 8, 10, 16, 17, 20, 34, 40, 68, 80, 85, 136, 170, 272, 340, 680, 1360.
What is 1360 in binary?
10101010000 (hexadecimal 550, octal 2520).
What is the square root of 1360?
About 36.8782, exactly 4√85.
What is 1360 in Roman numerals?
MCCCLX.
Is 1360 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1360?
1360 is a Harshad number: divisible by its digit sum 10.