The number 83157
83157 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 523. Divisors (8): 1, 3, 53, 159, 523, 1569, 27719, 83157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83157 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83157 is composite. Its prime factorisation is
- 3
The divisors add up to 113184; without 83157 itself that is 30027, so 83157 is deficient (30027 is less than 83157). Euler's totient φ(83157) = 54288 numbers up to 83157 share no factor with it.
- 4
The digits of 83157 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83157 = 3 \times 53 \times 523 \]
83157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 113184 |
| Euler totient φ(n) | 54288 |
| Square | 6915086649 |
| Cube | 575037860470893 |
| Square root | 288.369555 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.3157 × |
83157 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand one hundred and fifty-seven |
| Binary (base 2) | 10100010011010101 |
| Octal (base 8) | 242325 |
| Hexadecimal (base 16) | 144D5 |
| Base 3 | 11020001220 |
| As time | 83157 seconds = 23 h 5 min 57 s |
Is 83157 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 | Yes (83157 ÷ 3 = 27719) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83157 a prime number?
No. 83157 = 3 × 53 × 523, so it is divisible by 3.
What are the factors of 83157?
1, 3, 53, 159, 523, 1569, 27719, 83157.
What is 83157 in binary?
10100010011010101 (hexadecimal 144D5, octal 242325).
What is the square root of 83157?
About 288.3696.
Is 83157 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 83157?
It is a composite number with 8 divisors.