The number 81483
81483 is a composite number with 8 divisors. Its prime factorisation is 3 × 157 × 173. Divisors (8): 1, 3, 157, 173, 471, 519, 27161, 81483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81483 is composite. Its prime factorisation is
- 3
The divisors add up to 109968; without 81483 itself that is 28485, so 81483 is deficient (28485 is less than 81483). Euler's totient φ(81483) = 53664 numbers up to 81483 share no factor with it.
- 4
The digits of 81483 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81483 = 3 \times 157 \times 173 \]
81483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 109968 |
| Euler totient φ(n) | 53664 |
| Square | 6639479289 |
| Cube | 541004690905587 |
| Square root | 285.452273 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1483 × |
81483 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and eighty-three |
| Binary (base 2) | 10011111001001011 |
| Octal (base 8) | 237113 |
| Hexadecimal (base 16) | 13E4B |
| Base 3 | 11010202220 |
| As time | 81483 seconds = 22 h 38 min 3 s |
Is 81483 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 (81483 ÷ 3 = 27161) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81483 a prime number?
No. 81483 = 3 × 157 × 173, so it is divisible by 3.
What are the factors of 81483?
1, 3, 157, 173, 471, 519, 27161, 81483.
What is 81483 in binary?
10011111001001011 (hexadecimal 13E4B, octal 237113).
What is the square root of 81483?
About 285.4523.
Is 81483 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 81483?
It is a composite number with 8 divisors.