The number 47983
47983 is a composite number with 4 divisors. Its prime factorisation is 13 × 3691. Divisors (4): 1, 13, 3691, 47983.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47983: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3691, the product of two primes.
- 2
47983 is composite. Its prime factorisation is
- 3
The divisors add up to 51688; without 47983 itself that is 3705, so 47983 is deficient (3705 is less than 47983). Euler's totient φ(47983) = 44280 numbers up to 47983 share no factor with it.
- 4
The digits of 47983 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 220 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47983 = 13 \times 3691 \]
47983 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51688 |
| Euler totient φ(n) | 44280 |
| Square | 2302368289 |
| Cube | 110474537611087 |
| Square root | 219.050223 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 220 |
| Scientific notation | 4.7983 × |
47983 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and eighty-three |
| Binary (base 2) | 1011101101101111 |
| Octal (base 8) | 135557 |
| Hexadecimal (base 16) | BB6F |
| Base 3 | 2102211011 |
| As time | 47983 seconds = 13 h 19 min 43 s |
Is 47983 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 3) | 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 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 7) | 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 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47983 a prime number?
No. 47983 = 13 × 3691, so it is divisible by 13.
What are the factors of 47983?
1, 13, 3691, 47983.
What is 47983 in binary?
1011101101101111 (hexadecimal BB6F, octal 135557).
What is the square root of 47983?
About 219.0502.
Is 47983 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 47983?
47983 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3691, the product of two primes.