The number 84565
84565 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 1301. Divisors (8): 1, 5, 13, 65, 1301, 6505, 16913, 84565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84565 is composite. Its prime factorisation is
- 3
The divisors add up to 109368; without 84565 itself that is 24803, so 84565 is deficient (24803 is less than 84565). Euler's totient φ(84565) = 62400 numbers up to 84565 share no factor with it.
- 4
The digits of 84565 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 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84565 = 5 \times 13 \times 1301 \]
84565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109368 |
| Euler totient φ(n) | 62400 |
| Square | 7151239225 |
| Cube | 604744545062125 |
| Square root | 290.800619 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.4565 × |
84565 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand five hundred and sixty-five |
| Binary (base 2) | 10100101001010101 |
| Octal (base 8) | 245125 |
| Hexadecimal (base 16) | 14A55 |
| Base 3 | 11022000001 |
| As time | 84565 seconds = 23 h 29 min 25 s |
Is 84565 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 (84565 ÷ 5 = 16913) | 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 5) | 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 5) | 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 5) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84565 a prime number?
No. 84565 = 5 × 13 × 1301, so it is divisible by 5.
What are the factors of 84565?
1, 5, 13, 65, 1301, 6505, 16913, 84565.
What is 84565 in binary?
10100101001010101 (hexadecimal 14A55, octal 245125).
What is the square root of 84565?
About 290.8006.
Is 84565 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 84565?
It is a composite number with 8 divisors.