The number 62051
62051 is a composite number with 4 divisors. Its prime factorisation is 11 × 5641. Divisors (4): 1, 11, 5641, 62051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62051: a semiprime: 11 × 5641, the product of two primes.
- 2
62051 is composite. Its prime factorisation is
- 3
The divisors add up to 67704; without 62051 itself that is 5653, so 62051 is deficient (5653 is less than 62051). Euler's totient φ(62051) = 56400 numbers up to 62051 share no factor with it.
- 4
The digits of 62051 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62051 = 11 \times 5641 \]
62051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67704 |
| Euler totient φ(n) | 56400 |
| Square | 3850326601 |
| Cube | 238916615918651 |
| Square root | 249.100381 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.2051 × |
62051 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand and fifty-one |
| Binary (base 2) | 1111001001100011 |
| Octal (base 8) | 171143 |
| Hexadecimal (base 16) | F263 |
| Base 3 | 10011010012 |
| As time | 62051 seconds = 17 h 14 min 11 s |
Is 62051 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 | 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 3) | 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 5) | 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 | Yes (62051 ÷ 11 = 5641) | 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 62051 a prime number?
No. 62051 = 11 × 5641, so it is divisible by 11.
What are the factors of 62051?
1, 11, 5641, 62051.
What is 62051 in binary?
1111001001100011 (hexadecimal F263, octal 171143).
What is the square root of 62051?
About 249.1004.
Is 62051 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 62051?
62051 is a semiprime: 11 × 5641, the product of two primes.