The number 1363
1363 is a composite number with 4 divisors. Its prime factorisation is 29 × 47. Divisors (4): 1, 29, 47, 1363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1363: a semiprime: 29 × 47, the product of two primes.
- 2
1363 is composite. Its prime factorisation is
- 3
The divisors add up to 1440; without 1363 itself that is 77, so 1363 is deficient (77 is less than 1363). Euler's totient φ(1363) = 1288 numbers up to 1363 share no factor with it.
- 4
The digits of 1363 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1363 = 29 \times 47 \]
1363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1440 |
| Euler totient φ(n) | 1288 |
| Square | 1857769 |
| Cube | 2532139147 |
| Square root | 36.918830 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 1.363 × |
1363 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and sixty-three |
| Roman numerals | MCCCLXIII |
| Binary (base 2) | 10101010011 |
| Octal (base 8) | 2523 |
| Hexadecimal (base 16) | 553 |
| Base 3 | 1212111 |
| As time | 1363 seconds = 22 min 43 s |
Is 1363 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1363 a prime number?
No. 1363 = 29 × 47, so it is divisible by 29.
What are the factors of 1363?
1, 29, 47, 1363.
What is 1363 in binary?
10101010011 (hexadecimal 553, octal 2523).
What is the square root of 1363?
About 36.9188.
What is 1363 in Roman numerals?
MCCCLXIII.
Is 1363 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1363?
1363 is a semiprime: 29 × 47, the product of two primes.