The number 83398
83398 is a composite number with 24 divisors. Its prime factorisation is 2 × × 23 × 37. Divisors (24): 1, 2, 7, 14, 23, 37, 46, 49, 74, 98, 161, 259, 322, 518, 851, 1127 … 83398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83398 is composite. Its prime factorisation is
- 3
The divisors add up to 155952; without 83398 itself that is 72554, so 83398 is deficient (72554 is less than 83398). Euler's totient φ(83398) = 33264 numbers up to 83398 share no factor with it.
- 4
The digits of 83398 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83398 = 2 \times 7^{2} \times 23 \times 37 \]83398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 155952 |
| Euler totient φ(n) | 33264 |
| Square | 6955226404 |
| Cube | 580051971640792 |
| Square root | 288.787119 (= 7√1702) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.3398 × |
83398 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand three hundred and ninety-eight |
| Binary (base 2) | 10100010111000110 |
| Octal (base 8) | 242706 |
| Hexadecimal (base 16) | 145C6 |
| Base 3 | 11020101211 |
| As time | 83398 seconds = 23 h 9 min 58 s |
Is 83398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83398 ÷ 2 = 41699) | 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 | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (83398 ÷ 7 = 11914) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83398 a prime number?
No. 83398 = 2 × × 23 × 37, so it is divisible by 2.
What are the factors of 83398?
1, 2, 7, 14, 23, 37, 46, 49, 74, 98, 161, 259, 322, 518, 851, 1127, 1702, 1813, 2254, 3626, 5957, 11914, 41699, 83398.
What is 83398 in binary?
10100010111000110 (hexadecimal 145C6, octal 242706).
What is the square root of 83398?
About 288.7871, exactly 7√1702.
Is 83398 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 83398?
It is a composite number with 24 divisors.