The number 49072
49072 is a composite number with 10 divisors. Its prime factorisation is × 3067. Divisors (10): 1, 2, 4, 8, 16, 3067, 6134, 12268, 24536, 49072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49072 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49072 is composite. Its prime factorisation is
- 3
The divisors add up to 95108; without 49072 itself that is 46036, so 49072 is deficient (46036 is less than 49072). Euler's totient φ(49072) = 24528 numbers up to 49072 share no factor with it.
- 4
The digits of 49072 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49072 = 2^{4} \times 3067 \]49072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 95108 |
| Euler totient φ(n) | 24528 |
| Square | 2408061184 |
| Cube | 118168378421248 |
| Square root | 221.522008 (= 4√3067) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9072 × |
49072 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and seventy-two |
| Binary (base 2) | 1011111110110000 |
| Octal (base 8) | 137660 |
| Hexadecimal (base 16) | BFB0 |
| Base 3 | 2111022111 |
| As time | 49072 seconds = 13 h 37 min 52 s |
Is 49072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49072 ÷ 2 = 24536) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49072 ÷ 4 = 12268) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (49072 ÷ 8 = 6134) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49072 a prime number?
No. 49072 = × 3067, so it is divisible by 2.
What are the factors of 49072?
1, 2, 4, 8, 16, 3067, 6134, 12268, 24536, 49072.
What is 49072 in binary?
1011111110110000 (hexadecimal BFB0, octal 137660).
What is the square root of 49072?
About 221.5220, exactly 4√3067.
Is 49072 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49072?
It is a composite number with 10 divisors.