The number 83947
83947 is a composite number with 4 divisors. Its prime factorisation is 127 × 661. Divisors (4): 1, 127, 661, 83947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83947: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 661, the product of two primes.
- 2
83947 is composite. Its prime factorisation is
- 3
The divisors add up to 84736; without 83947 itself that is 789, so 83947 is deficient (789 is less than 83947). Euler's totient φ(83947) = 83160 numbers up to 83947 share no factor with it.
- 4
The digits of 83947 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83947 = 127 \times 661 \]
83947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84736 |
| Euler totient φ(n) | 83160 |
| Square | 7047098809 |
| Cube | 591582803719123 |
| Square root | 289.736087 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.3947 × |
83947 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand nine hundred and forty-seven |
| Binary (base 2) | 10100011111101011 |
| Octal (base 8) | 243753 |
| Hexadecimal (base 16) | 147EB |
| Base 3 | 11021011011 |
| As time | 83947 seconds = 23 h 19 min 7 s |
Is 83947 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 1) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83947 a prime number?
No. 83947 = 127 × 661, so it is divisible by 127.
What are the factors of 83947?
1, 127, 661, 83947.
What is 83947 in binary?
10100011111101011 (hexadecimal 147EB, octal 243753).
What is the square root of 83947?
About 289.7361.
Is 83947 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 83947?
83947 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 661, the product of two primes.