The number 65152
65152 is a composite number with 16 divisors. Its prime factorisation is × 509. Divisors (16): 1, 2, 4, 8, 16, 32, 64, 128, 509, 1018, 2036, 4072, 8144, 16288, 32576, 65152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
65152 is composite. Its prime factorisation is
- 3
The divisors add up to 130050; without 65152 itself that is 64898, so 65152 is deficient (64898 is less than 65152). Euler's totient φ(65152) = 32512 numbers up to 65152 share no factor with it.
- 4
The digits of 65152 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65152 = 2^{7} \times 509 \]65152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 130050 |
| Euler totient φ(n) | 32512 |
| Square | 4244783104 |
| Cube | 276556108791808 |
| Square root | 255.248898 (= 8√1018) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.5152 × |
65152 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand one hundred and fifty-two |
| Binary (base 2) | 1111111010000000 |
| Octal (base 8) | 177200 |
| Hexadecimal (base 16) | FE80 |
| Base 3 | 10022101001 |
| As time | 65152 seconds = 18 h 5 min 52 s |
Is 65152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65152 ÷ 2 = 32576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (65152 ÷ 4 = 16288) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (65152 ÷ 8 = 8144) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65152 a prime number?
No. 65152 = × 509, so it is divisible by 2.
What are the factors of 65152?
1, 2, 4, 8, 16, 32, 64, 128, 509, 1018, 2036, 4072, 8144, 16288, 32576, 65152.
What is 65152 in binary?
1111111010000000 (hexadecimal FE80, octal 177200).
What is the square root of 65152?
About 255.2489, exactly 8√1018.
Is 65152 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 65152?
65152 is a happy number: repeatedly adding the squares of its digits reaches 1.