The number 1371
1371 is a composite number with 4 divisors. Its prime factorisation is 3 × 457. Divisors (4): 1, 3, 457, 1371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1371: a semiprime: 3 × 457, the product of two primes.
- 2
1371 is composite. Its prime factorisation is
- 3
The divisors add up to 1832; without 1371 itself that is 461, so 1371 is deficient (461 is less than 1371). Euler's totient φ(1371) = 912 numbers up to 1371 share no factor with it.
- 4
The digits of 1371 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1371 = 3 \times 457 \]
1371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1832 |
| Euler totient φ(n) | 912 |
| Square | 1879641 |
| Cube | 2576987811 |
| Square root | 37.027017 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 114 |
| Scientific notation | 1.371 × |
1371 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and seventy-one |
| Roman numerals | MCCCLXXI |
| Binary (base 2) | 10101011011 |
| Octal (base 8) | 2533 |
| Hexadecimal (base 16) | 55B |
| Base 3 | 1212210 |
| As time | 1371 seconds = 22 min 51 s |
Is 1371 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 (1371 ÷ 3 = 457) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | 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 1371 a prime number?
No. 1371 = 3 × 457, so it is divisible by 3.
What are the factors of 1371?
1, 3, 457, 1371.
What is 1371 in binary?
10101011011 (hexadecimal 55B, octal 2533).
What is the square root of 1371?
About 37.0270.
What is 1371 in Roman numerals?
MCCCLXXI.
Is 1371 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1371?
1371 is a semiprime: 3 × 457, the product of two primes.