The number 46964
46964 is a palindrome: it reads 46964 backwards too. Its prime factorisation is × 59 × 199. Divisors (12): 1, 2, 4, 59, 118, 199, 236, 398, 796, 11741, 23482, 46964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46964: a palindrome: it reads 46964 backwards too.
- 2
46964 is composite. Its prime factorisation is
- 3
The divisors add up to 84000; without 46964 itself that is 37036, so 46964 is deficient (37036 is less than 46964). Euler's totient φ(46964) = 22968 numbers up to 46964 share no factor with it.
- 4
The digits of 46964 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46964 = 2^{2} \times 59 \times 199 \]46964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 84000 |
| Euler totient φ(n) | 22968 |
| Square | 2205617296 |
| Cube | 103584610689344 |
| Square root | 216.711790 (= 2√11741) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6964 × |
46964 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and sixty-four |
| Binary (base 2) | 1011011101110100 |
| Octal (base 8) | 133564 |
| Hexadecimal (base 16) | B774 |
| Base 3 | 2101102102 |
| As time | 46964 seconds = 13 h 2 min 44 s |
Is 46964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46964 ÷ 2 = 23482) | 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 | Yes (46964 ÷ 4 = 11741) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46964 a prime number?
No. 46964 = × 59 × 199, so it is divisible by 2.
What are the factors of 46964?
1, 2, 4, 59, 118, 199, 236, 398, 796, 11741, 23482, 46964.
What is 46964 in binary?
1011011101110100 (hexadecimal B774, octal 133564).
What is the square root of 46964?
About 216.7118, exactly 2√11741.
Is 46964 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 46964?
46964 is a palindrome: it reads 46964 backwards too.