The number 62641
62641 is a composite number with 4 divisors. Its prime factorisation is 37 × 1693. Divisors (4): 1, 37, 1693, 62641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62641: a semiprime: 37 × 1693, the product of two primes.
- 2
62641 is composite. Its prime factorisation is
- 3
The divisors add up to 64372; without 62641 itself that is 1731, so 62641 is deficient (1731 is less than 62641). Euler's totient φ(62641) = 60912 numbers up to 62641 share no factor with it.
- 4
The digits of 62641 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62641 = 37 \times 1693 \]
62641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64372 |
| Euler totient φ(n) | 60912 |
| Square | 3923894881 |
| Cube | 245796699240721 |
| Square root | 250.281841 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.2641 × |
62641 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand six hundred and forty-one |
| Binary (base 2) | 1111010010110001 |
| Octal (base 8) | 172261 |
| Hexadecimal (base 16) | F4B1 |
| Base 3 | 10011221001 |
| As time | 62641 seconds = 17 h 24 min 1 s |
Is 62641 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 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 1) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62641 a prime number?
No. 62641 = 37 × 1693, so it is divisible by 37.
What are the factors of 62641?
1, 37, 1693, 62641.
What is 62641 in binary?
1111010010110001 (hexadecimal F4B1, octal 172261).
What is the square root of 62641?
About 250.2818.
Is 62641 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 62641?
62641 is a semiprime: 37 × 1693, the product of two primes.