The number 46956
46956 is a composite number with 48 divisors. Its prime factorisation is × 3 × 7 × 13 × 43. Divisors (48): 1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 39, 42, 43, 52 … 46956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46956 is composite. Its prime factorisation is
- 3
The divisors add up to 137984; without 46956 itself that is 91028, so 46956 is abundant (91028 is more than 46956). Euler's totient φ(46956) = 12096 numbers up to 46956 share no factor with it.
- 4
The digits of 46956 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46956 = 2^{2} \times 3 \times 7 \times 13 \times 43 \]46956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 137984 |
| Euler totient φ(n) | 12096 |
| Square | 2204865936 |
| Cube | 103531684890816 |
| Square root | 216.693332 (= 2√11739) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6956 × |
46956 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifty-six |
| Binary (base 2) | 1011011101101100 |
| Octal (base 8) | 133554 |
| Hexadecimal (base 16) | B76C |
| Base 3 | 2101102010 |
| As time | 46956 seconds = 13 h 2 min 36 s |
Is 46956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46956 ÷ 2 = 23478) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46956 ÷ 3 = 15652) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (46956 ÷ 4 = 11739) | 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 (46956 ÷ 6 = 7826) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (46956 ÷ 7 = 6708) | 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 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 | Yes (46956 ÷ 12 = 3913) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46956 a prime number?
No. 46956 = × 3 × 7 × 13 × 43, so it is divisible by 2.
What are the factors of 46956?
1, 2, 3, 4, 6, 7, 12, 13, 14, 21, 26, 28, 39, 42, 43, 52, 78, 84, 86, 91, 129, 156, 172, 182, 258, 273, 301, 364, 516, 546, 559, 602, 903, 1092, 1118, 1204, 1677, 1806, 2236, 3354, 3612, 3913, 6708, 7826, 11739, 15652, 23478, 46956.
What is 46956 in binary?
1011011101101100 (hexadecimal B76C, octal 133554).
What is the square root of 46956?
About 216.6933, exactly 2√11739.
Is 46956 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 46956?
It is a composite number with 48 divisors.