The number 49964
49964 is a composite number with 6 divisors. Its prime factorisation is × 12491. Divisors (6): 1, 2, 4, 12491, 24982, 49964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49964: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49964 is composite. Its prime factorisation is
- 3
The divisors add up to 87444; without 49964 itself that is 37480, so 49964 is deficient (37480 is less than 49964). Euler's totient φ(49964) = 24980 numbers up to 49964 share no factor with it.
- 4
The digits of 49964 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49964 = 2^{2} \times 12491 \]49964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87444 |
| Euler totient φ(n) | 24980 |
| Square | 2496401296 |
| Cube | 124730194353344 |
| Square root | 223.526285 (= 2√12491) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9964 × |
49964 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and sixty-four |
| Binary (base 2) | 1100001100101100 |
| Octal (base 8) | 141454 |
| Hexadecimal (base 16) | C32C |
| Base 3 | 2112112112 |
| As time | 49964 seconds = 13 h 52 min 44 s |
Is 49964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49964 ÷ 2 = 24982) | 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 (49964 ÷ 4 = 12491) | 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 5) | 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 5) | 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 2) | 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 49964 a prime number?
No. 49964 = × 12491, so it is divisible by 2.
What are the factors of 49964?
1, 2, 4, 12491, 24982, 49964.
What is 49964 in binary?
1100001100101100 (hexadecimal C32C, octal 141454).
What is the square root of 49964?
About 223.5263, exactly 2√12491.
Is 49964 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49964?
49964 is a happy number: repeatedly adding the squares of its digits reaches 1.