The number 61371
61371 is a composite number with 8 divisors. Its prime factorisation is × 2273. Divisors (8): 1, 3, 9, 27, 2273, 6819, 20457, 61371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61371 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61371 is composite. Its prime factorisation is
- 3
The divisors add up to 90960; without 61371 itself that is 29589, so 61371 is deficient (29589 is less than 61371). Euler's totient φ(61371) = 40896 numbers up to 61371 share no factor with it.
- 4
The digits of 61371 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61371 = 3^{3} \times 2273 \]61371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90960 |
| Euler totient φ(n) | 40896 |
| Square | 3766399641 |
| Cube | 231147712367811 |
| Square root | 247.731710 (= 3√6819) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.1371 × |
61371 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand three hundred and seventy-one |
| Binary (base 2) | 1110111110111011 |
| Octal (base 8) | 167673 |
| Hexadecimal (base 16) | EFBB |
| Base 3 | 10010012000 |
| As time | 61371 seconds = 17 h 2 min 51 s |
Is 61371 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 (61371 ÷ 3 = 20457) | 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 2) | 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 | Yes (61371 ÷ 9 = 6819) | 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 2) | 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 61371 a prime number?
No. 61371 = × 2273, so it is divisible by 3.
What are the factors of 61371?
1, 3, 9, 27, 2273, 6819, 20457, 61371.
What is 61371 in binary?
1110111110111011 (hexadecimal EFBB, octal 167673).
What is the square root of 61371?
About 247.7317, exactly 3√6819.
Is 61371 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 61371?
It is a composite number with 8 divisors.