The number 49512
49512 is a composite number with 16 divisors. Its prime factorisation is × 3 × 2063. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 2063, 4126, 6189, 8252, 12378, 16504, 24756, 49512.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49512 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49512 is composite. Its prime factorisation is
- 3
The divisors add up to 123840; without 49512 itself that is 74328, so 49512 is abundant (74328 is more than 49512). Euler's totient φ(49512) = 16496 numbers up to 49512 share no factor with it.
- 4
The digits of 49512 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49512 = 2^{3} \times 3 \times 2063 \]49512 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123840 |
| Euler totient φ(n) | 16496 |
| Square | 2451438144 |
| Cube | 121375605385728 |
| Square root | 222.512921 (= 2√12378) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9512 × |
49512 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and twelve |
| Binary (base 2) | 1100000101101000 |
| Octal (base 8) | 140550 |
| Hexadecimal (base 16) | C168 |
| Base 3 | 2111220210 |
| As time | 49512 seconds = 13 h 45 min 12 s |
Is 49512 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49512 ÷ 2 = 24756) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49512 ÷ 3 = 16504) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49512 ÷ 4 = 12378) | 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 (49512 ÷ 6 = 8252) | 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 (49512 ÷ 8 = 6189) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49512 ÷ 12 = 4126) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49512 a prime number?
No. 49512 = × 3 × 2063, so it is divisible by 2.
What are the factors of 49512?
1, 2, 3, 4, 6, 8, 12, 24, 2063, 4126, 6189, 8252, 12378, 16504, 24756, 49512.
What is 49512 in binary?
1100000101101000 (hexadecimal C168, octal 140550).
What is the square root of 49512?
About 222.5129, exactly 2√12378.
Is 49512 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49512?
It is a composite number with 16 divisors.