The number 61555
61555 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 947. Divisors (8): 1, 5, 13, 65, 947, 4735, 12311, 61555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61555 is composite. Its prime factorisation is
- 3
The divisors add up to 79632; without 61555 itself that is 18077, so 61555 is deficient (18077 is less than 61555). Euler's totient φ(61555) = 45408 numbers up to 61555 share no factor with it.
- 4
The digits of 61555 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61555 = 5 \times 13 \times 947 \]
61555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79632 |
| Euler totient φ(n) | 45408 |
| Square | 3789018025 |
| Cube | 233233004528875 |
| Square root | 248.102801 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1555 × |
61555 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and fifty-five |
| Binary (base 2) | 1111000001110011 |
| Octal (base 8) | 170163 |
| Hexadecimal (base 16) | F073 |
| Base 3 | 10010102211 |
| As time | 61555 seconds = 17 h 5 min 55 s |
Is 61555 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 1) | 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 (61555 ÷ 5 = 12311) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61555 a prime number?
No. 61555 = 5 × 13 × 947, so it is divisible by 5.
What are the factors of 61555?
1, 5, 13, 65, 947, 4735, 12311, 61555.
What is 61555 in binary?
1111000001110011 (hexadecimal F073, octal 170163).
What is the square root of 61555?
About 248.1028.
Is 61555 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 61555?
It is a composite number with 8 divisors.