The number 65301
65301 is a composite number with 4 divisors. Its prime factorisation is 3 × 21767. Divisors (4): 1, 3, 21767, 65301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65301: a semiprime: 3 × 21767, the product of two primes.
- 2
65301 is composite. Its prime factorisation is
- 3
The divisors add up to 87072; without 65301 itself that is 21771, so 65301 is deficient (21771 is less than 65301). Euler's totient φ(65301) = 43532 numbers up to 65301 share no factor with it.
- 4
The digits of 65301 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65301 = 3 \times 21767 \]
65301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87072 |
| Euler totient φ(n) | 43532 |
| Square | 4264220601 |
| Cube | 278457869465901 |
| Square root | 255.540603 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.5301 × |
65301 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand three hundred and one |
| Binary (base 2) | 1111111100010101 |
| Octal (base 8) | 177425 |
| Hexadecimal (base 16) | FF15 |
| Base 3 | 10022120120 |
| As time | 65301 seconds = 18 h 8 min 21 s |
Is 65301 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 | Yes (65301 ÷ 3 = 21767) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65301 a prime number?
No. 65301 = 3 × 21767, so it is divisible by 3.
What are the factors of 65301?
1, 3, 21767, 65301.
What is 65301 in binary?
1111111100010101 (hexadecimal FF15, octal 177425).
What is the square root of 65301?
About 255.5406.
Is 65301 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 65301?
65301 is a semiprime: 3 × 21767, the product of two primes.