The number 49064
49064 is a composite number with 8 divisors. Its prime factorisation is × 6133. Divisors (8): 1, 2, 4, 8, 6133, 12266, 24532, 49064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49064 is composite. Its prime factorisation is
- 3
The divisors add up to 92010; without 49064 itself that is 42946, so 49064 is deficient (42946 is less than 49064). Euler's totient φ(49064) = 24528 numbers up to 49064 share no factor with it.
- 4
The digits of 49064 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49064 = 2^{3} \times 6133 \]49064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 92010 |
| Euler totient φ(n) | 24528 |
| Square | 2407276096 |
| Cube | 118110594374144 |
| Square root | 221.503950 (= 2√12266) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9064 × |
49064 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-four |
| Binary (base 2) | 1011111110101000 |
| Octal (base 8) | 137650 |
| Hexadecimal (base 16) | BFA8 |
| Base 3 | 2111022012 |
| As time | 49064 seconds = 13 h 37 min 44 s |
Is 49064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49064 ÷ 2 = 24532) | 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 (49064 ÷ 4 = 12266) | 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 | Yes (49064 ÷ 8 = 6133) | 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 4) | 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 49064 a prime number?
No. 49064 = × 6133, so it is divisible by 2.
What are the factors of 49064?
1, 2, 4, 8, 6133, 12266, 24532, 49064.
What is 49064 in binary?
1011111110101000 (hexadecimal BFA8, octal 137650).
What is the square root of 49064?
About 221.5040, exactly 2√12266.
Is 49064 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49064?
It is a composite number with 8 divisors.