The number 47993
47993 is a composite number with 4 divisors. Its prime factorisation is 11 × 4363. Divisors (4): 1, 11, 4363, 47993.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47993: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4363, the product of two primes.
- 2
47993 is composite. Its prime factorisation is
- 3
The divisors add up to 52368; without 47993 itself that is 4375, so 47993 is deficient (4375 is less than 47993). Euler's totient φ(47993) = 43620 numbers up to 47993 share no factor with it.
- 4
The digits of 47993 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47993 = 11 \times 4363 \]
47993 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52368 |
| Euler totient φ(n) | 43620 |
| Square | 2303328049 |
| Cube | 110543623055657 |
| Square root | 219.073047 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.7993 × |
47993 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and ninety-three |
| Binary (base 2) | 1011101101111001 |
| Octal (base 8) | 135571 |
| Hexadecimal (base 16) | BB79 |
| Base 3 | 2102211112 |
| As time | 47993 seconds = 13 h 19 min 53 s |
Is 47993 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (47993 ÷ 11 = 4363) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47993 a prime number?
No. 47993 = 11 × 4363, so it is divisible by 11.
What are the factors of 47993?
1, 11, 4363, 47993.
What is 47993 in binary?
1011101101111001 (hexadecimal BB79, octal 135571).
What is the square root of 47993?
About 219.0730.
Is 47993 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 47993?
47993 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4363, the product of two primes.