The number 65151
65151 is a binary palindrome (1111111001111111). Its prime factorisation is × 19 × 127. Divisors (16): 1, 3, 9, 19, 27, 57, 127, 171, 381, 513, 1143, 2413, 3429, 7239, 21717, 65151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65151: a binary palindrome (1111111001111111).
- 2
65151 is composite. Its prime factorisation is
- 3
The divisors add up to 102400; without 65151 itself that is 37249, so 65151 is deficient (37249 is less than 65151). Euler's totient φ(65151) = 40824 numbers up to 65151 share no factor with it.
- 4
The digits of 65151 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 205 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65151 = 3^{3} \times 19 \times 127 \]65151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 102400 |
| Euler totient φ(n) | 40824 |
| Square | 4244652801 |
| Cube | 276543374637951 |
| Square root | 255.246939 (= 3√7239) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 205 |
| Scientific notation | 6.5151 × |
65151 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand one hundred and fifty-one |
| Binary (base 2) | 1111111001111111 |
| Octal (base 8) | 177177 |
| Hexadecimal (base 16) | FE7F |
| Base 3 | 10022101000 |
| As time | 65151 seconds = 18 h 5 min 51 s |
Is 65151 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 (65151 ÷ 3 = 21717) | 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 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (65151 ÷ 9 = 7239) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65151 a prime number?
No. 65151 = × 19 × 127, so it is divisible by 3.
What are the factors of 65151?
1, 3, 9, 19, 27, 57, 127, 171, 381, 513, 1143, 2413, 3429, 7239, 21717, 65151.
What is 65151 in binary?
1111111001111111 (hexadecimal FE7F, octal 177177).
What is the square root of 65151?
About 255.2469, exactly 3√7239.
Is 65151 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 65151?
65151 is a binary palindrome (1111111001111111).