The number 80476
80476 is a composite number with 24 divisors. Its prime factorisation is × 11 × 31 × 59. Divisors (24): 1, 2, 4, 11, 22, 31, 44, 59, 62, 118, 124, 236, 341, 649, 682, 1298 … 80476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80476 is composite. Its prime factorisation is
- 3
The divisors add up to 161280; without 80476 itself that is 80804, so 80476 is abundant (80804 is more than 80476). Euler's totient φ(80476) = 34800 numbers up to 80476 share no factor with it.
- 4
The digits of 80476 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80476 = 2^{2} \times 11 \times 31 \times 59 \]80476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 161280 |
| Euler totient φ(n) | 34800 |
| Square | 6476386576 |
| Cube | 521193686090176 |
| Square root | 283.682922 (= 2√20119) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.0476 × |
80476 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and seventy-six |
| Binary (base 2) | 10011101001011100 |
| Octal (base 8) | 235134 |
| Hexadecimal (base 16) | 13A5C |
| Base 3 | 11002101121 |
| As time | 80476 seconds = 22 h 21 min 16 s |
Is 80476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80476 ÷ 2 = 40238) | 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 (80476 ÷ 4 = 20119) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | Yes (80476 ÷ 11 = 7316) | 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 80476 a prime number?
No. 80476 = × 11 × 31 × 59, so it is divisible by 2.
What are the factors of 80476?
1, 2, 4, 11, 22, 31, 44, 59, 62, 118, 124, 236, 341, 649, 682, 1298, 1364, 1829, 2596, 3658, 7316, 20119, 40238, 80476.
What is 80476 in binary?
10011101001011100 (hexadecimal 13A5C, octal 235134).
What is the square root of 80476?
About 283.6829, exactly 2√20119.
Is 80476 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 80476?
It is a composite number with 24 divisors.