The number 83956
83956 is a composite number with 12 divisors. Its prime factorisation is × 139 × 151. Divisors (12): 1, 2, 4, 139, 151, 278, 302, 556, 604, 20989, 41978, 83956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
83956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
83956 is composite. Its prime factorisation is
- 3
The divisors add up to 148960; without 83956 itself that is 65004, so 83956 is deficient (65004 is less than 83956). Euler's totient φ(83956) = 41400 numbers up to 83956 share no factor with it.
- 4
The digits of 83956 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83956 = 2^{2} \times 139 \times 151 \]83956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 148960 |
| Euler totient φ(n) | 41400 |
| Square | 7048609936 |
| Cube | 591773095786816 |
| Square root | 289.751618 (= 2√20989) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.3956 × |
83956 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand nine hundred and fifty-six |
| Binary (base 2) | 10100011111110100 |
| Octal (base 8) | 243764 |
| Hexadecimal (base 16) | 147F4 |
| Base 3 | 11021011111 |
| As time | 83956 seconds = 23 h 19 min 16 s |
Is 83956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83956 ÷ 2 = 41978) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (83956 ÷ 4 = 20989) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83956 a prime number?
No. 83956 = × 139 × 151, so it is divisible by 2.
What are the factors of 83956?
1, 2, 4, 139, 151, 278, 302, 556, 604, 20989, 41978, 83956.
What is 83956 in binary?
10100011111110100 (hexadecimal 147F4, octal 243764).
What is the square root of 83956?
About 289.7516, exactly 2√20989.
Is 83956 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 83956?
It is a composite number with 12 divisors.