The number 65330
65330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 47 × 139. Divisors (16): 1, 2, 5, 10, 47, 94, 139, 235, 278, 470, 695, 1390, 6533, 13066, 32665, 65330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
65330 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 65330 itself that is 55630, so 65330 is deficient (55630 is less than 65330). Euler's totient φ(65330) = 25392 numbers up to 65330 share no factor with it.
- 4
The digits of 65330 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65330 = 2 \times 5 \times 47 \times 139 \]
65330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 25392 |
| Square | 4268008900 |
| Cube | 278829021437000 |
| Square root | 255.597340 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.533 × |
65330 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand three hundred and thirty |
| Binary (base 2) | 1111111100110010 |
| Octal (base 8) | 177462 |
| Hexadecimal (base 16) | FF32 |
| Base 3 | 10022121122 |
| As time | 65330 seconds = 18 h 8 min 50 s |
Is 65330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65330 ÷ 2 = 32665) | 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 | Yes (65330 ÷ 5 = 13066) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (65330 ÷ 10 = 6533) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 65330 a prime number?
No. 65330 = 2 × 5 × 47 × 139, so it is divisible by 2.
What are the factors of 65330?
1, 2, 5, 10, 47, 94, 139, 235, 278, 470, 695, 1390, 6533, 13066, 32665, 65330.
What is 65330 in binary?
1111111100110010 (hexadecimal FF32, octal 177462).
What is the square root of 65330?
About 255.5973.
Is 65330 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 65330?
65330 is a happy number: repeatedly adding the squares of its digits reaches 1.