The number 62561
62561 is a composite number with 4 divisors. Its prime factorisation is 73 × 857. Divisors (4): 1, 73, 857, 62561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62561: a semiprime: 73 × 857, the product of two primes.
- 2
62561 is composite. Its prime factorisation is
- 3
The divisors add up to 63492; without 62561 itself that is 931, so 62561 is deficient (931 is less than 62561). Euler's totient φ(62561) = 61632 numbers up to 62561 share no factor with it.
- 4
The digits of 62561 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 254 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62561 = 73 \times 857 \]
62561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63492 |
| Euler totient φ(n) | 61632 |
| Square | 3913878721 |
| Cube | 244856166664481 |
| Square root | 250.121970 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 254 |
| Scientific notation | 6.2561 × |
62561 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand five hundred and sixty-one |
| Binary (base 2) | 1111010001100001 |
| Octal (base 8) | 172141 |
| Hexadecimal (base 16) | F461 |
| Base 3 | 10011211002 |
| As time | 62561 seconds = 17 h 22 min 41 s |
Is 62561 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 1) | 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 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62561 a prime number?
No. 62561 = 73 × 857, so it is divisible by 73.
What are the factors of 62561?
1, 73, 857, 62561.
What is 62561 in binary?
1111010001100001 (hexadecimal F461, octal 172141).
What is the square root of 62561?
About 250.1220.
Is 62561 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 62561?
62561 is a semiprime: 73 × 857, the product of two primes.