The number 84476
84476 is a composite number with 18 divisors. Its prime factorisation is × × 431. Divisors (18): 1, 2, 4, 7, 14, 28, 49, 98, 196, 431, 862, 1724, 3017, 6034, 12068, 21119 … 84476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
84476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
84476 is composite. Its prime factorisation is
- 3
The divisors add up to 172368; without 84476 itself that is 87892, so 84476 is abundant (87892 is more than 84476). Euler's totient φ(84476) = 36120 numbers up to 84476 share no factor with it.
- 4
The digits of 84476 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 84476 = 2^{2} \times 7^{2} \times 431 \]84476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 172368 |
| Euler totient φ(n) | 36120 |
| Square | 7136194576 |
| Cube | 602837173002176 |
| Square root | 290.647553 (= 14√431) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 81 |
| Scientific notation | 8.4476 × |
84476 in other forms
| Form | Value |
|---|---|
| In words | eighty-four thousand four hundred and seventy-six |
| Binary (base 2) | 10100100111111100 |
| Octal (base 8) | 244774 |
| Hexadecimal (base 16) | 149FC |
| Base 3 | 11021212202 |
| As time | 84476 seconds = 23 h 27 min 56 s |
Is 84476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (84476 ÷ 2 = 42238) | 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 (84476 ÷ 4 = 21119) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (84476 ÷ 7 = 12068) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 84476 a prime number?
No. 84476 = × × 431, so it is divisible by 2.
What are the factors of 84476?
1, 2, 4, 7, 14, 28, 49, 98, 196, 431, 862, 1724, 3017, 6034, 12068, 21119, 42238, 84476.
What is 84476 in binary?
10100100111111100 (hexadecimal 149FC, octal 244774).
What is the square root of 84476?
About 290.6476, exactly 14√431.
Is 84476 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 84476?
It is a composite number with 18 divisors.