The number 25936
25936 is a composite number with 10 divisors. Its prime factorisation is × 1621. Divisors (10): 1, 2, 4, 8, 16, 1621, 3242, 6484, 12968, 25936.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25936 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25936 is composite. Its prime factorisation is
- 3
The divisors add up to 50282; without 25936 itself that is 24346, so 25936 is deficient (24346 is less than 25936). Euler's totient φ(25936) = 12960 numbers up to 25936 share no factor with it.
- 4
The digits of 25936 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25936 = 2^{4} \times 1621 \]25936 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 50282 |
| Euler totient φ(n) | 12960 |
| Square | 672676096 |
| Cube | 17446527225856 |
| Square root | 161.046577 (= 4√1621) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 33 |
| Scientific notation | 2.5936 × |
25936 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and thirty-six |
| Binary (base 2) | 110010101010000 |
| Octal (base 8) | 62520 |
| Hexadecimal (base 16) | 6550 |
| Base 3 | 1022120121 |
| As time | 25936 seconds = 7 h 12 min 16 s |
Is 25936 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25936 ÷ 2 = 12968) | 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 (25936 ÷ 4 = 6484) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (25936 ÷ 8 = 3242) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 25936 a prime number?
No. 25936 = × 1621, so it is divisible by 2.
What are the factors of 25936?
1, 2, 4, 8, 16, 1621, 3242, 6484, 12968, 25936.
What is 25936 in binary?
110010101010000 (hexadecimal 6550, octal 62520).
What is the square root of 25936?
About 161.0466, exactly 4√1621.
Is 25936 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 25936?
It is a composite number with 10 divisors.