The number 25912
25912 is a composite number with 16 divisors. Its prime factorisation is × 41 × 79. Divisors (16): 1, 2, 4, 8, 41, 79, 82, 158, 164, 316, 328, 632, 3239, 6478, 12956, 25912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25912 is composite. Its prime factorisation is
- 3
The divisors add up to 50400; without 25912 itself that is 24488, so 25912 is deficient (24488 is less than 25912). Euler's totient φ(25912) = 12480 numbers up to 25912 share no factor with it.
- 4
The digits of 25912 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 126 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25912 = 2^{3} \times 41 \times 79 \]25912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 50400 |
| Euler totient φ(n) | 12480 |
| Square | 671431744 |
| Cube | 17398139350528 |
| Square root | 160.972047 (= 2√6478) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 126 |
| Scientific notation | 2.5912 × |
25912 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and twelve |
| Binary (base 2) | 110010100111000 |
| Octal (base 8) | 62470 |
| Hexadecimal (base 16) | 6538 |
| Base 3 | 1022112201 |
| As time | 25912 seconds = 7 h 11 min 52 s |
Is 25912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25912 ÷ 2 = 12956) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (25912 ÷ 4 = 6478) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (25912 ÷ 8 = 3239) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25912 a prime number?
No. 25912 = × 41 × 79, so it is divisible by 2.
What are the factors of 25912?
1, 2, 4, 8, 41, 79, 82, 158, 164, 316, 328, 632, 3239, 6478, 12956, 25912.
What is 25912 in binary?
110010100111000 (hexadecimal 6538, octal 62470).
What is the square root of 25912?
About 160.9720, exactly 2√6478.
Is 25912 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 25912?
It is a composite number with 16 divisors.