The number 1366
1366 is a composite number with 4 divisors. Its prime factorisation is 2 × 683. Divisors (4): 1, 2, 683, 1366.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1366: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 683, the product of two primes.
- 2
1366 is composite. Its prime factorisation is
- 3
The divisors add up to 2052; without 1366 itself that is 686, so 1366 is deficient (686 is less than 1366). Euler's totient φ(1366) = 682 numbers up to 1366 share no factor with it.
- 4
The digits of 1366 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1366 = 2 \times 683 \]
1366 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2052 |
| Euler totient φ(n) | 682 |
| Square | 1865956 |
| Cube | 2548895896 |
| Square root | 36.959437 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.366 × |
1366 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and sixty-six |
| Roman numerals | MCCCLXVI |
| Binary (base 2) | 10101010110 |
| Octal (base 8) | 2526 |
| Hexadecimal (base 16) | 556 |
| Base 3 | 1212121 |
| As time | 1366 seconds = 22 min 46 s |
Is 1366 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1366 ÷ 2 = 683) | 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 | No (remainder 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1366 a prime number?
No. 1366 = 2 × 683, so it is divisible by 2.
What are the factors of 1366?
1, 2, 683, 1366.
What is 1366 in binary?
10101010110 (hexadecimal 556, octal 2526).
What is the square root of 1366?
About 36.9594.
What is 1366 in Roman numerals?
MCCCLXVI.
Is 1366 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1366?
1366 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 683, the product of two primes.