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