The number 61535
61535 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 397. Divisors (8): 1, 5, 31, 155, 397, 1985, 12307, 61535.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61535 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61535 is composite. Its prime factorisation is
- 3
The divisors add up to 76416; without 61535 itself that is 14881, so 61535 is deficient (14881 is less than 61535). Euler's totient φ(61535) = 47520 numbers up to 61535 share no factor with it.
- 4
The digits of 61535 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61535 = 5 \times 31 \times 397 \]
61535 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76416 |
| Euler totient φ(n) | 47520 |
| Square | 3786556225 |
| Cube | 233005737305375 |
| Square root | 248.062492 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1535 × |
61535 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and thirty-five |
| Binary (base 2) | 1111000001011111 |
| Octal (base 8) | 170137 |
| Hexadecimal (base 16) | F05F |
| Base 3 | 10010102002 |
| As time | 61535 seconds = 17 h 5 min 35 s |
Is 61535 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 | Yes (61535 ÷ 5 = 12307) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61535 a prime number?
No. 61535 = 5 × 31 × 397, so it is divisible by 5.
What are the factors of 61535?
1, 5, 31, 155, 397, 1985, 12307, 61535.
What is 61535 in binary?
1111000001011111 (hexadecimal F05F, octal 170137).
What is the square root of 61535?
About 248.0625.
Is 61535 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 61535?
It is a composite number with 8 divisors.