The number 84641
84641 is a composite number with 4 divisors. Its prime factorisation is 53 × 1597. Divisors (4): 1, 53, 1597, 84641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 84641: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 1597, the product of two primes.
- 2
84641 is composite. Its prime factorisation is
- 3
The divisors add up to 86292; without 84641 itself that is 1651, so 84641 is deficient (1651 is less than 84641). Euler's totient φ(84641) = 82992 numbers up to 84641 share no factor with it.
- 4
The digits of 84641 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84641 = 53 \times 1597 \]
84641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86292 |
| Euler totient φ(n) | 82992 |
| Square | 7164098881 |
| Cube | 606376493386721 |
| Square root | 290.931263 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 58 |
| Scientific notation | 8.4641 × |
84641 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand six hundred and forty-one |
| Binary (base 2) | 10100101010100001 |
| Octal (base 8) | 245241 |
| Hexadecimal (base 16) | 14AA1 |
| Base 3 | 11022002212 |
| As time | 84641 seconds = 23 h 30 min 41 s |
Is 84641 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84641 a prime number?
No. 84641 = 53 × 1597, so it is divisible by 53.
What are the factors of 84641?
1, 53, 1597, 84641.
What is 84641 in binary?
10100101010100001 (hexadecimal 14AA1, octal 245241).
What is the square root of 84641?
About 290.9313.
Is 84641 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 84641?
84641 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 1597, the product of two primes.