The number 83498
83498 is a composite number with 8 divisors. Its prime factorisation is 2 × 83 × 503. Divisors (8): 1, 2, 83, 166, 503, 1006, 41749, 83498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83498 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83498 is composite. Its prime factorisation is
- 3
The divisors add up to 127008; without 83498 itself that is 43510, so 83498 is deficient (43510 is less than 83498). Euler's totient φ(83498) = 41164 numbers up to 83498 share no factor with it.
- 4
The digits of 83498 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83498 = 2 \times 83 \times 503 \]
83498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 127008 |
| Euler totient φ(n) | 41164 |
| Square | 6971916004 |
| Cube | 582141042501992 |
| Square root | 288.960205 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 58 |
| Scientific notation | 8.3498 × |
83498 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand four hundred and ninety-eight |
| Binary (base 2) | 10100011000101010 |
| Octal (base 8) | 243052 |
| Hexadecimal (base 16) | 1462A |
| Base 3 | 11020112112 |
| As time | 83498 seconds = 23 h 11 min 38 s |
Is 83498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83498 ÷ 2 = 41749) | 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 2) | 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 2) | 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 2) | 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83498 a prime number?
No. 83498 = 2 × 83 × 503, so it is divisible by 2.
What are the factors of 83498?
1, 2, 83, 166, 503, 1006, 41749, 83498.
What is 83498 in binary?
10100011000101010 (hexadecimal 1462A, octal 243052).
What is the square root of 83498?
About 288.9602.
Is 83498 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 83498?
It is a composite number with 8 divisors.