The number 1347
1347 is a composite number with 4 divisors. Its prime factorisation is 3 × 449. Divisors (4): 1, 3, 449, 1347.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1347: a semiprime: 3 × 449, the product of two primes.
- 2
1347 is composite. Its prime factorisation is
- 3
The divisors add up to 1800; without 1347 itself that is 453, so 1347 is deficient (453 is less than 1347). Euler's totient φ(1347) = 896 numbers up to 1347 share no factor with it.
- 4
The digits of 1347 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1347 = 3 \times 449 \]
1347 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1800 |
| Euler totient φ(n) | 896 |
| Square | 1814409 |
| Cube | 2444008923 |
| Square root | 36.701499 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 1.347 × |
1347 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and forty-seven |
| Roman numerals | MCCCXLVII |
| Binary (base 2) | 10101000011 |
| Octal (base 8) | 2503 |
| Hexadecimal (base 16) | 543 |
| Base 3 | 1211220 |
| As time | 1347 seconds = 22 min 27 s |
Is 1347 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 (1347 ÷ 3 = 449) | 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 3) | 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 6) | 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 5) | 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 1347 a prime number?
No. 1347 = 3 × 449, so it is divisible by 3.
What are the factors of 1347?
1, 3, 449, 1347.
What is 1347 in binary?
10101000011 (hexadecimal 543, octal 2503).
What is the square root of 1347?
About 36.7015.
What is 1347 in Roman numerals?
MCCCXLVII.
Is 1347 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1347?
1347 is a semiprime: 3 × 449, the product of two primes.