The number 46932
46932 is a composite number with 12 divisors. Its prime factorisation is × 3 × 3911. Divisors (12): 1, 2, 3, 4, 6, 12, 3911, 7822, 11733, 15644, 23466, 46932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46932 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46932 is composite. Its prime factorisation is
- 3
The divisors add up to 109536; without 46932 itself that is 62604, so 46932 is abundant (62604 is more than 46932). Euler's totient φ(46932) = 15640 numbers up to 46932 share no factor with it.
- 4
The digits of 46932 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 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46932 = 2^{2} \times 3 \times 3911 \]46932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 109536 |
| Euler totient φ(n) | 15640 |
| Square | 2202612624 |
| Cube | 103373015669568 |
| Square root | 216.637947 (= 2√11733) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.6932 × |
46932 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and thirty-two |
| Binary (base 2) | 1011011101010100 |
| Octal (base 8) | 133524 |
| Hexadecimal (base 16) | B754 |
| Base 3 | 2101101020 |
| As time | 46932 seconds = 13 h 2 min 12 s |
Is 46932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46932 ÷ 2 = 23466) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46932 ÷ 3 = 15644) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (46932 ÷ 4 = 11733) | 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 | Yes (46932 ÷ 6 = 7822) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (46932 ÷ 12 = 3911) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46932 a prime number?
No. 46932 = × 3 × 3911, so it is divisible by 2.
What are the factors of 46932?
1, 2, 3, 4, 6, 12, 3911, 7822, 11733, 15644, 23466, 46932.
What is 46932 in binary?
1011011101010100 (hexadecimal B754, octal 133524).
What is the square root of 46932?
About 216.6379, exactly 2√11733.
Is 46932 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46932?
It is a composite number with 12 divisors.