The number 46942
46942 is a composite number with 12 divisors. Its prime factorisation is 2 × × 479. Divisors (12): 1, 2, 7, 14, 49, 98, 479, 958, 3353, 6706, 23471, 46942.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46942 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46942 is composite. Its prime factorisation is
- 3
The divisors add up to 82080; without 46942 itself that is 35138, so 46942 is deficient (35138 is less than 46942). Euler's totient φ(46942) = 20076 numbers up to 46942 share no factor with it.
- 4
The digits of 46942 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46942 = 2 \times 7^{2} \times 479 \]46942 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82080 |
| Euler totient φ(n) | 20076 |
| Square | 2203551364 |
| Cube | 103439108128888 |
| Square root | 216.661026 (= 7√958) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6942 × |
46942 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and forty-two |
| Binary (base 2) | 1011011101011110 |
| Octal (base 8) | 133536 |
| Hexadecimal (base 16) | B75E |
| Base 3 | 2101101121 |
| As time | 46942 seconds = 13 h 2 min 22 s |
Is 46942 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46942 ÷ 2 = 23471) | 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 | Yes (46942 ÷ 7 = 6706) | 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 7) | 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 5) | 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 46942 a prime number?
No. 46942 = 2 × × 479, so it is divisible by 2.
What are the factors of 46942?
1, 2, 7, 14, 49, 98, 479, 958, 3353, 6706, 23471, 46942.
What is 46942 in binary?
1011011101011110 (hexadecimal B75E, octal 133536).
What is the square root of 46942?
About 216.6610, exactly 7√958.
Is 46942 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46942?
It is a composite number with 12 divisors.