The number 83150
83150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1663. Divisors (12): 1, 2, 5, 10, 25, 50, 1663, 3326, 8315, 16630, 41575, 83150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83150 is composite. Its prime factorisation is
- 3
The divisors add up to 154752; without 83150 itself that is 71602, so 83150 is deficient (71602 is less than 83150). Euler's totient φ(83150) = 33240 numbers up to 83150 share no factor with it.
- 4
The digits of 83150 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83150 = 2 \times 5^{2} \times 1663 \]83150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 154752 |
| Euler totient φ(n) | 33240 |
| Square | 6913922500 |
| Cube | 574892655875000 |
| Square root | 288.357417 (= 5√3326) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 112 |
| Scientific notation | 8.315 × |
83150 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand one hundred and fifty |
| Binary (base 2) | 10100010011001110 |
| Octal (base 8) | 242316 |
| Hexadecimal (base 16) | 144CE |
| Base 3 | 11020001122 |
| As time | 83150 seconds = 23 h 5 min 50 s |
Is 83150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83150 ÷ 2 = 41575) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (83150 ÷ 5 = 16630) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 | Yes (83150 ÷ 10 = 8315) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83150 a prime number?
No. 83150 = 2 × × 1663, so it is divisible by 2.
What are the factors of 83150?
1, 2, 5, 10, 25, 50, 1663, 3326, 8315, 16630, 41575, 83150.
What is 83150 in binary?
10100010011001110 (hexadecimal 144CE, octal 242316).
What is the square root of 83150?
About 288.3574, exactly 5√3326.
Is 83150 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 83150?
It is a composite number with 12 divisors.