The number 61562
61562 is a composite number with 4 divisors. Its prime factorisation is 2 × 30781. Divisors (4): 1, 2, 30781, 61562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61562: a semiprime: 2 × 30781, the product of two primes.
- 2
61562 is composite. Its prime factorisation is
- 3
The divisors add up to 92346; without 61562 itself that is 30784, so 61562 is deficient (30784 is less than 61562). Euler's totient φ(61562) = 30780 numbers up to 61562 share no factor with it.
- 4
The digits of 61562 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61562 = 2 \times 30781 \]
61562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92346 |
| Euler totient φ(n) | 30780 |
| Square | 3789879844 |
| Cube | 233312582956328 |
| Square root | 248.116908 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1562 × |
61562 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and sixty-two |
| Binary (base 2) | 1111000001111010 |
| Octal (base 8) | 170172 |
| Hexadecimal (base 16) | F07A |
| Base 3 | 10010110002 |
| As time | 61562 seconds = 17 h 6 min 2 s |
Is 61562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61562 ÷ 2 = 30781) | 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 2) | 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 2) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61562 a prime number?
No. 61562 = 2 × 30781, so it is divisible by 2.
What are the factors of 61562?
1, 2, 30781, 61562.
What is 61562 in binary?
1111000001111010 (hexadecimal F07A, octal 170172).
What is the square root of 61562?
About 248.1169.
Is 61562 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 61562?
61562 is a semiprime: 2 × 30781, the product of two primes.