The number 80483
80483 is a composite number with 8 divisors. Its prime factorisation is 13 × 41 × 151. Divisors (8): 1, 13, 41, 151, 533, 1963, 6191, 80483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80483 is composite. Its prime factorisation is
- 3
The divisors add up to 89376; without 80483 itself that is 8893, so 80483 is deficient (8893 is less than 80483). Euler's totient φ(80483) = 72000 numbers up to 80483 share no factor with it.
- 4
The digits of 80483 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80483 = 13 \times 41 \times 151 \]
80483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89376 |
| Euler totient φ(n) | 72000 |
| Square | 6477513289 |
| Cube | 521329702038587 |
| Square root | 283.695259 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.0483 × |
80483 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and eighty-three |
| Binary (base 2) | 10011101001100011 |
| Octal (base 8) | 235143 |
| Hexadecimal (base 16) | 13A63 |
| Base 3 | 11002101212 |
| As time | 80483 seconds = 22 h 21 min 23 s |
Is 80483 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 3) | 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 3) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80483 a prime number?
No. 80483 = 13 × 41 × 151, so it is divisible by 13.
What are the factors of 80483?
1, 13, 41, 151, 533, 1963, 6191, 80483.
What is 80483 in binary?
10011101001100011 (hexadecimal 13A63, octal 235143).
What is the square root of 80483?
About 283.6953.
Is 80483 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 80483?
It is a composite number with 8 divisors.