The number 80481
80481 is a composite number with 8 divisors. Its prime factorisation is 3 × 139 × 193. Divisors (8): 1, 3, 139, 193, 417, 579, 26827, 80481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80481 is composite. Its prime factorisation is
- 3
The divisors add up to 108640; without 80481 itself that is 28159, so 80481 is deficient (28159 is less than 80481). Euler's totient φ(80481) = 52992 numbers up to 80481 share no factor with it.
- 4
The digits of 80481 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80481 = 3 \times 139 \times 193 \]
80481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108640 |
| Euler totient φ(n) | 52992 |
| Square | 6477191361 |
| Cube | 521290837924641 |
| Square root | 283.691734 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.0481 × |
80481 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and eighty-one |
| Binary (base 2) | 10011101001100001 |
| Octal (base 8) | 235141 |
| Hexadecimal (base 16) | 13A61 |
| Base 3 | 11002101210 |
| As time | 80481 seconds = 22 h 21 min 21 s |
Is 80481 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 | Yes (80481 ÷ 3 = 26827) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80481 a prime number?
No. 80481 = 3 × 139 × 193, so it is divisible by 3.
What are the factors of 80481?
1, 3, 139, 193, 417, 579, 26827, 80481.
What is 80481 in binary?
10011101001100001 (hexadecimal 13A61, octal 235141).
What is the square root of 80481?
About 283.6917.
Is 80481 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 80481?
It is a composite number with 8 divisors.