The number 25748
25748 is a composite number with 12 divisors. Its prime factorisation is × 41 × 157. Divisors (12): 1, 2, 4, 41, 82, 157, 164, 314, 628, 6437, 12874, 25748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25748 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25748 is composite. Its prime factorisation is
- 3
The divisors add up to 46452; without 25748 itself that is 20704, so 25748 is deficient (20704 is less than 25748). Euler's totient φ(25748) = 12480 numbers up to 25748 share no factor with it.
- 4
The digits of 25748 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25748 = 2^{2} \times 41 \times 157 \]25748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 46452 |
| Euler totient φ(n) | 12480 |
| Square | 662959504 |
| Cube | 17069881308992 |
| Square root | 160.461833 (= 2√6437) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 77 |
| Scientific notation | 2.5748 × |
25748 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand seven hundred and forty-eight |
| Binary (base 2) | 110010010010100 |
| Octal (base 8) | 62224 |
| Hexadecimal (base 16) | 6494 |
| Base 3 | 1022022122 |
| As time | 25748 seconds = 7 h 9 min 8 s |
Is 25748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25748 ÷ 2 = 12874) | 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 (25748 ÷ 4 = 6437) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25748 a prime number?
No. 25748 = × 41 × 157, so it is divisible by 2.
What are the factors of 25748?
1, 2, 4, 41, 82, 157, 164, 314, 628, 6437, 12874, 25748.
What is 25748 in binary?
110010010010100 (hexadecimal 6494, octal 62224).
What is the square root of 25748?
About 160.4618, exactly 2√6437.
Is 25748 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 25748?
It is a composite number with 12 divisors.