The number 4371
4371 is a triangular number: 1 + 2 + … + 93 = 4371. Its prime factorisation is 3 × 31 × 47. Divisors (8): 1, 3, 31, 47, 93, 141, 1457, 4371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4371: a triangular number: 1 + 2 + … + 93 = 4371.
- 2
4371 is composite. Its prime factorisation is
- 3
The divisors add up to 6144; without 4371 itself that is 1773, so 4371 is deficient (1773 is less than 4371). Euler's totient φ(4371) = 2760 numbers up to 4371 share no factor with it.
- 4
The digits of 4371 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 108 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4371 = 3 \times 31 \times 47 \]
4371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6144 |
| Euler totient φ(n) | 2760 |
| Square | 19105641 |
| Cube | 83510756811 |
| Square root | 66.113539 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 108 |
| Scientific notation | 4.371 × |
4371 in other forms
| Form | Value |
|---|---|
| In words | four thousand three hundred and seventy-one |
| Binary (base 2) | 1000100010011 |
| Octal (base 8) | 10423 |
| Hexadecimal (base 16) | 1113 |
| Base 3 | 12222220 |
| As time | 4371 seconds = 1 h 12 min 51 s |
Is 4371 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 (4371 ÷ 3 = 1457) | 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 4371 a prime number?
No. 4371 = 3 × 31 × 47, so it is divisible by 3.
What are the factors of 4371?
1, 3, 31, 47, 93, 141, 1457, 4371.
What is 4371 in binary?
1000100010011 (hexadecimal 1113, octal 10423).
What is the square root of 4371?
About 66.1135.
Is 4371 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 4371?
4371 is a triangular number: 1 + 2 + … + 93 = 4371.