The number 47946
47946 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 61 × 131. Divisors (16): 1, 2, 3, 6, 61, 122, 131, 183, 262, 366, 393, 786, 7991, 15982, 23973, 47946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47946 is composite. Its prime factorisation is
- 3
The divisors add up to 98208; without 47946 itself that is 50262, so 47946 is abundant (50262 is more than 47946). Euler's totient φ(47946) = 15600 numbers up to 47946 share no factor with it.
- 4
The digits of 47946 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47946 = 2 \times 3 \times 61 \times 131 \]
47946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98208 |
| Euler totient φ(n) | 15600 |
| Square | 2298818916 |
| Cube | 110219171746536 |
| Square root | 218.965751 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7946 × |
47946 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and forty-six |
| Binary (base 2) | 1011101101001010 |
| Octal (base 8) | 135512 |
| Hexadecimal (base 16) | BB4A |
| Base 3 | 2102202210 |
| As time | 47946 seconds = 13 h 19 min 6 s |
Is 47946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47946 ÷ 2 = 23973) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47946 ÷ 3 = 15982) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (47946 ÷ 6 = 7991) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47946 a prime number?
No. 47946 = 2 × 3 × 61 × 131, so it is divisible by 2.
What are the factors of 47946?
1, 2, 3, 6, 61, 122, 131, 183, 262, 366, 393, 786, 7991, 15982, 23973, 47946.
What is 47946 in binary?
1011101101001010 (hexadecimal BB4A, octal 135512).
What is the square root of 47946?
About 218.9658.
Is 47946 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 47946?
It is a composite number with 16 divisors.