The number 25465
25465 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 463. Divisors (8): 1, 5, 11, 55, 463, 2315, 5093, 25465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
25465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
25465 is composite. Its prime factorisation is
- 3
The divisors add up to 33408; without 25465 itself that is 7943, so 25465 is deficient (7943 is less than 25465). Euler's totient φ(25465) = 18480 numbers up to 25465 share no factor with it.
- 4
The digits of 25465 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 139 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25465 = 5 \times 11 \times 463 \]
25465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 33408 |
| Euler totient φ(n) | 18480 |
| Square | 648466225 |
| Cube | 16513192419625 |
| Square root | 159.577567 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 139 |
| Scientific notation | 2.5465 × |
25465 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand four hundred and sixty-five |
| Binary (base 2) | 110001101111001 |
| Octal (base 8) | 61571 |
| Hexadecimal (base 16) | 6379 |
| Base 3 | 1021221011 |
| As time | 25465 seconds = 7 h 4 min 25 s |
Is 25465 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (25465 ÷ 5 = 5093) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (25465 ÷ 11 = 2315) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25465 a prime number?
No. 25465 = 5 × 11 × 463, so it is divisible by 5.
What are the factors of 25465?
1, 5, 11, 55, 463, 2315, 5093, 25465.
What is 25465 in binary?
110001101111001 (hexadecimal 6379, octal 61571).
What is the square root of 25465?
About 159.5776.
Is 25465 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 25465?
It is a composite number with 8 divisors.