The number 83476
83476 is a composite number with 12 divisors. Its prime factorisation is × 41 × 509. Divisors (12): 1, 2, 4, 41, 82, 164, 509, 1018, 2036, 20869, 41738, 83476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83476 is composite. Its prime factorisation is
- 3
The divisors add up to 149940; without 83476 itself that is 66464, so 83476 is deficient (66464 is less than 83476). Euler's totient φ(83476) = 40640 numbers up to 83476 share no factor with it.
- 4
The digits of 83476 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83476 = 2^{2} \times 41 \times 509 \]83476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 149940 |
| Euler totient φ(n) | 40640 |
| Square | 6968242576 |
| Cube | 581681017274176 |
| Square root | 288.922135 (= 2√20869) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.3476 × |
83476 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand four hundred and seventy-six |
| Binary (base 2) | 10100011000010100 |
| Octal (base 8) | 243024 |
| Hexadecimal (base 16) | 14614 |
| Base 3 | 11020111201 |
| As time | 83476 seconds = 23 h 11 min 16 s |
Is 83476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83476 ÷ 2 = 41738) | 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 (83476 ÷ 4 = 20869) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83476 a prime number?
No. 83476 = × 41 × 509, so it is divisible by 2.
What are the factors of 83476?
1, 2, 4, 41, 82, 164, 509, 1018, 2036, 20869, 41738, 83476.
What is 83476 in binary?
10100011000010100 (hexadecimal 14614, octal 243024).
What is the square root of 83476?
About 288.9221, exactly 2√20869.
Is 83476 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 83476?
It is a composite number with 12 divisors.