The number 80398
80398 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 659. Divisors (8): 1, 2, 61, 122, 659, 1318, 40199, 80398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80398 is composite. Its prime factorisation is
- 3
The divisors add up to 122760; without 80398 itself that is 42362, so 80398 is deficient (42362 is less than 80398). Euler's totient φ(80398) = 39480 numbers up to 80398 share no factor with it.
- 4
The digits of 80398 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80398 = 2 \times 61 \times 659 \]
80398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 122760 |
| Euler totient φ(n) | 39480 |
| Square | 6463838404 |
| Cube | 519679680004792 |
| Square root | 283.545411 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.0398 × |
80398 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand three hundred and ninety-eight |
| Binary (base 2) | 10011101000001110 |
| Octal (base 8) | 235016 |
| Hexadecimal (base 16) | 13A0E |
| Base 3 | 11002021201 |
| As time | 80398 seconds = 22 h 19 min 58 s |
Is 80398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80398 ÷ 2 = 40199) | 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 | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | 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 80398 a prime number?
No. 80398 = 2 × 61 × 659, so it is divisible by 2.
What are the factors of 80398?
1, 2, 61, 122, 659, 1318, 40199, 80398.
What is 80398 in binary?
10011101000001110 (hexadecimal 13A0E, octal 235016).
What is the square root of 80398?
About 283.5454.
Is 80398 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 80398?
It is a composite number with 8 divisors.