The number 65483
65483 is a composite number with 4 divisors. Its prime factorisation is 11 × 5953. Divisors (4): 1, 11, 5953, 65483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65483: a semiprime: 11 × 5953, the product of two primes.
- 2
65483 is composite. Its prime factorisation is
- 3
The divisors add up to 71448; without 65483 itself that is 5965, so 65483 is deficient (5965 is less than 65483). Euler's totient φ(65483) = 59520 numbers up to 65483 share no factor with it.
- 4
The digits of 65483 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65483 = 11 \times 5953 \]
65483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71448 |
| Euler totient φ(n) | 59520 |
| Square | 4288023289 |
| Cube | 280792629033587 |
| Square root | 255.896463 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.5483 × |
65483 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and eighty-three |
| Binary (base 2) | 1111111111001011 |
| Octal (base 8) | 177713 |
| Hexadecimal (base 16) | FFCB |
| Base 3 | 10022211022 |
| As time | 65483 seconds = 18 h 11 min 23 s |
Is 65483 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 | Yes (65483 ÷ 11 = 5953) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65483 a prime number?
No. 65483 = 11 × 5953, so it is divisible by 11.
What are the factors of 65483?
1, 11, 5953, 65483.
What is 65483 in binary?
1111111111001011 (hexadecimal FFCB, octal 177713).
What is the square root of 65483?
About 255.8965.
Is 65483 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 65483?
65483 is a semiprime: 11 × 5953, the product of two primes.