The number 65498
65498 is a composite number with 4 divisors. Its prime factorisation is 2 × 32749. Divisors (4): 1, 2, 32749, 65498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65498: a semiprime: 2 × 32749, the product of two primes.
- 2
65498 is composite. Its prime factorisation is
- 3
The divisors add up to 98250; without 65498 itself that is 32752, so 65498 is deficient (32752 is less than 65498). Euler's totient φ(65498) = 32748 numbers up to 65498 share no factor with it.
- 4
The digits of 65498 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65498 = 2 \times 32749 \]
65498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98250 |
| Euler totient φ(n) | 32748 |
| Square | 4289988004 |
| Cube | 280985634285992 |
| Square root | 255.925770 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.5498 × |
65498 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and ninety-eight |
| Binary (base 2) | 1111111111011010 |
| Octal (base 8) | 177732 |
| Hexadecimal (base 16) | FFDA |
| Base 3 | 10022211212 |
| As time | 65498 seconds = 18 h 11 min 38 s |
Is 65498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65498 ÷ 2 = 32749) | 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 6) | 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 4) | 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 65498 a prime number?
No. 65498 = 2 × 32749, so it is divisible by 2.
What are the factors of 65498?
1, 2, 32749, 65498.
What is 65498 in binary?
1111111111011010 (hexadecimal FFDA, octal 177732).
What is the square root of 65498?
About 255.9258.
Is 65498 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 65498?
65498 is a semiprime: 2 × 32749, the product of two primes.