The number 83051
83051 is a composite number with 4 divisors. Its prime factorisation is 53 × 1567. Divisors (4): 1, 53, 1567, 83051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83051: a semiprime: 53 × 1567, the product of two primes.
- 2
83051 is composite. Its prime factorisation is
- 3
The divisors add up to 84672; without 83051 itself that is 1621, so 83051 is deficient (1621 is less than 83051). Euler's totient φ(83051) = 81432 numbers up to 83051 share no factor with it.
- 4
The digits of 83051 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 213 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83051 = 53 \times 1567 \]
83051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84672 |
| Euler totient φ(n) | 81432 |
| Square | 6897468601 |
| Cube | 572841664781651 |
| Square root | 288.185704 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.3051 × |
83051 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand and fifty-one |
| Binary (base 2) | 10100010001101011 |
| Octal (base 8) | 242153 |
| Hexadecimal (base 16) | 1446B |
| Base 3 | 11012220222 |
| As time | 83051 seconds = 23 h 4 min 11 s |
Is 83051 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 8) | 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 1) | 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 83051 a prime number?
No. 83051 = 53 × 1567, so it is divisible by 53.
What are the factors of 83051?
1, 53, 1567, 83051.
What is 83051 in binary?
10100010001101011 (hexadecimal 1446B, octal 242153).
What is the square root of 83051?
About 288.1857.
Is 83051 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 83051?
83051 is a semiprime: 53 × 1567, the product of two primes.