The number 46941
46941 is a composite number with 4 divisors. Its prime factorisation is 3 × 15647. Divisors (4): 1, 3, 15647, 46941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46941: a semiprime: 3 × 15647, the product of two primes.
- 2
46941 is composite. Its prime factorisation is
- 3
The divisors add up to 62592; without 46941 itself that is 15651, so 46941 is deficient (15651 is less than 46941). Euler's totient φ(46941) = 31292 numbers up to 46941 share no factor with it.
- 4
The digits of 46941 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46941 = 3 \times 15647 \]
46941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62592 |
| Euler totient φ(n) | 31292 |
| Square | 2203457481 |
| Cube | 103432497615621 |
| Square root | 216.658718 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6941 × |
46941 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and forty-one |
| Binary (base 2) | 1011011101011101 |
| Octal (base 8) | 133535 |
| Hexadecimal (base 16) | B75D |
| Base 3 | 2101101120 |
| As time | 46941 seconds = 13 h 2 min 21 s |
Is 46941 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 | Yes (46941 ÷ 3 = 15647) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46941 a prime number?
No. 46941 = 3 × 15647, so it is divisible by 3.
What are the factors of 46941?
1, 3, 15647, 46941.
What is 46941 in binary?
1011011101011101 (hexadecimal B75D, octal 133535).
What is the square root of 46941?
About 216.6587.
Is 46941 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46941?
46941 is a semiprime: 3 × 15647, the product of two primes.