The number 46982
46982 is a composite number with 12 divisors. Its prime factorisation is 2 × × 139. Divisors (12): 1, 2, 13, 26, 139, 169, 278, 338, 1807, 3614, 23491, 46982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46982 is composite. Its prime factorisation is
- 3
The divisors add up to 76860; without 46982 itself that is 29878, so 46982 is deficient (29878 is less than 46982). Euler's totient φ(46982) = 21528 numbers up to 46982 share no factor with it.
- 4
The digits of 46982 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46982 = 2 \times 13^{2} \times 139 \]46982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76860 |
| Euler totient φ(n) | 21528 |
| Square | 2207308324 |
| Cube | 103703759678168 |
| Square root | 216.753316 (= 13√278) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6982 × |
46982 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and eighty-two |
| Binary (base 2) | 1011011110000110 |
| Octal (base 8) | 133606 |
| Hexadecimal (base 16) | B786 |
| Base 3 | 2101110002 |
| As time | 46982 seconds = 13 h 3 min 2 s |
Is 46982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46982 ÷ 2 = 23491) | 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 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 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46982 a prime number?
No. 46982 = 2 × × 139, so it is divisible by 2.
What are the factors of 46982?
1, 2, 13, 26, 139, 169, 278, 338, 1807, 3614, 23491, 46982.
What is 46982 in binary?
1011011110000110 (hexadecimal B786, octal 133606).
What is the square root of 46982?
About 216.7533, exactly 13√278.
Is 46982 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 46982?
It is a composite number with 12 divisors.