The number 25948
25948 is a composite number with 12 divisors. Its prime factorisation is × 13 × 499. Divisors (12): 1, 2, 4, 13, 26, 52, 499, 998, 1996, 6487, 12974, 25948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25948: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
25948 is composite. Its prime factorisation is
- 3
The divisors add up to 49000; without 25948 itself that is 23052, so 25948 is deficient (23052 is less than 25948). Euler's totient φ(25948) = 11952 numbers up to 25948 share no factor with it.
- 4
The digits of 25948 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25948 = 2^{2} \times 13 \times 499 \]25948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 49000 |
| Euler totient φ(n) | 11952 |
| Square | 673298704 |
| Cube | 17470754771392 |
| Square root | 161.083829 (= 2√6487) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 51 |
| Scientific notation | 2.5948 × |
25948 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand nine hundred and forty-eight |
| Binary (base 2) | 110010101011100 |
| Octal (base 8) | 62534 |
| Hexadecimal (base 16) | 655C |
| Base 3 | 1022121001 |
| As time | 25948 seconds = 7 h 12 min 28 s |
Is 25948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25948 ÷ 2 = 12974) | 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 (25948 ÷ 4 = 6487) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 10) | 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 25948 a prime number?
No. 25948 = × 13 × 499, so it is divisible by 2.
What are the factors of 25948?
1, 2, 4, 13, 26, 52, 499, 998, 1996, 6487, 12974, 25948.
What is 25948 in binary?
110010101011100 (hexadecimal 655C, octal 62534).
What is the square root of 25948?
About 161.0838, exactly 2√6487.
Is 25948 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 25948?
25948 is a happy number: repeatedly adding the squares of its digits reaches 1.