The number 371
371 is an Armstrong number: each digit raised to the power 3 adds up to 371. Its prime factorisation is 7 × 53. Divisors (4): 1, 7, 53, 371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 371: an Armstrong number: each digit raised to the power 3 adds up to 371; a semiprime: 7 × 53, the product of two primes.
- 2
371 is composite. Its prime factorisation is
- 3
The divisors add up to 432; without 371 itself that is 61, so 371 is deficient (61 is less than 371). Euler's totient φ(371) = 312 numbers up to 371 share no factor with it.
- 4
The digits of 371 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 371 = 7 \times 53 \]
371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 432 |
| Euler totient φ(n) | 312 |
| Square | 137641 |
| Cube | 51064811 |
| Square root | 19.261360 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 45 |
| Scientific notation | 3.71 × |
371 in other forms
| Form | Value |
|---|---|
| In words | three hundred and seventy-one |
| Roman numerals | CCCLXXI |
| Binary (base 2) | 101110011 |
| Octal (base 8) | 563 |
| Hexadecimal (base 16) | 173 |
| Base 3 | 111202 |
| As time | 371 seconds = 6 min 11 s |
Is 371 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (371 ÷ 7 = 53) | 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 2) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 371 a prime number?
No. 371 = 7 × 53, so it is divisible by 7.
What are the factors of 371?
1, 7, 53, 371.
What is 371 in binary?
101110011 (hexadecimal 173, octal 563).
What is the square root of 371?
About 19.2614.
What is 371 in Roman numerals?
CCCLXXI.
Is 371 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 371?
371 is an Armstrong number: each digit raised to the power 3 adds up to 371; a semiprime: 7 × 53, the product of two primes.