The number 83261
83261 is a composite number with 4 divisors. Its prime factorisation is 139 × 599. Divisors (4): 1, 139, 599, 83261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83261: a semiprime: 139 × 599, the product of two primes.
- 2
83261 is composite. Its prime factorisation is
- 3
The divisors add up to 84000; without 83261 itself that is 739, so 83261 is deficient (739 is less than 83261). Euler's totient φ(83261) = 82524 numbers up to 83261 share no factor with it.
- 4
The digits of 83261 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83261 = 139 \times 599 \]
83261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84000 |
| Euler totient φ(n) | 82524 |
| Square | 6932394121 |
| Cube | 577198066908581 |
| Square root | 288.549822 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 112 |
| Scientific notation | 8.3261 × |
83261 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand two hundred and sixty-one |
| Binary (base 2) | 10100010100111101 |
| Octal (base 8) | 242475 |
| Hexadecimal (base 16) | 1453D |
| Base 3 | 11020012202 |
| As time | 83261 seconds = 23 h 7 min 41 s |
Is 83261 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 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 5) | 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 2) | 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 83261 a prime number?
No. 83261 = 139 × 599, so it is divisible by 139.
What are the factors of 83261?
1, 139, 599, 83261.
What is 83261 in binary?
10100010100111101 (hexadecimal 1453D, octal 242475).
What is the square root of 83261?
About 288.5498.
Is 83261 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 83261?
83261 is a semiprime: 139 × 599, the product of two primes.