The number 25671
25671 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 199. Divisors (8): 1, 3, 43, 129, 199, 597, 8557, 25671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25671 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25671 is composite. Its prime factorisation is
- 3
The divisors add up to 35200; without 25671 itself that is 9529, so 25671 is deficient (9529 is less than 25671). Euler's totient φ(25671) = 16632 numbers up to 25671 share no factor with it.
- 4
The digits of 25671 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25671 = 3 \times 43 \times 199 \]
25671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 35200 |
| Euler totient φ(n) | 16632 |
| Square | 659000241 |
| Cube | 16917195186711 |
| Square root | 160.221721 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5671 × |
25671 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand six hundred and seventy-one |
| Binary (base 2) | 110010001000111 |
| Octal (base 8) | 62107 |
| Hexadecimal (base 16) | 6447 |
| Base 3 | 1022012210 |
| As time | 25671 seconds = 7 h 7 min 51 s |
Is 25671 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 (25671 ÷ 3 = 8557) | 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 7) | 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 8) | 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 25671 a prime number?
No. 25671 = 3 × 43 × 199, so it is divisible by 3.
What are the factors of 25671?
1, 3, 43, 129, 199, 597, 8557, 25671.
What is 25671 in binary?
110010001000111 (hexadecimal 6447, octal 62107).
What is the square root of 25671?
About 160.2217.
Is 25671 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 25671?
It is a composite number with 8 divisors.