The number 47962
47962 is a composite number with 4 divisors. Its prime factorisation is 2 × 23981. Divisors (4): 1, 2, 23981, 47962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47962: a semiprime: 2 × 23981, the product of two primes.
- 2
47962 is composite. Its prime factorisation is
- 3
The divisors add up to 71946; without 47962 itself that is 23984, so 47962 is deficient (23984 is less than 47962). Euler's totient φ(47962) = 23980 numbers up to 47962 share no factor with it.
- 4
The digits of 47962 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47962 = 2 \times 23981 \]
47962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71946 |
| Euler totient φ(n) | 23980 |
| Square | 2300353444 |
| Cube | 110329551881128 |
| Square root | 219.002283 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7962 × |
47962 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and sixty-two |
| Binary (base 2) | 1011101101011010 |
| Octal (base 8) | 135532 |
| Hexadecimal (base 16) | BB5A |
| Base 3 | 2102210101 |
| As time | 47962 seconds = 13 h 19 min 22 s |
Is 47962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47962 ÷ 2 = 23981) | 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 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47962 a prime number?
No. 47962 = 2 × 23981, so it is divisible by 2.
What are the factors of 47962?
1, 2, 23981, 47962.
What is 47962 in binary?
1011101101011010 (hexadecimal BB5A, octal 135532).
What is the square root of 47962?
About 219.0023.
Is 47962 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 47962?
47962 is a semiprime: 2 × 23981, the product of two primes.