The number 49372
49372 is a composite number with 6 divisors. Its prime factorisation is × 12343. Divisors (6): 1, 2, 4, 12343, 24686, 49372.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49372 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49372 is composite. Its prime factorisation is
- 3
The divisors add up to 86408; without 49372 itself that is 37036, so 49372 is deficient (37036 is less than 49372). Euler's totient φ(49372) = 24684 numbers up to 49372 share no factor with it.
- 4
The digits of 49372 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 264 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49372 = 2^{2} \times 12343 \]49372 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 86408 |
| Euler totient φ(n) | 24684 |
| Square | 2437594384 |
| Cube | 120348909926848 |
| Square root | 222.198110 (= 2√12343) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 264 |
| Scientific notation | 4.9372 × |
49372 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and seventy-two |
| Binary (base 2) | 1100000011011100 |
| Octal (base 8) | 140334 |
| Hexadecimal (base 16) | C0DC |
| Base 3 | 2111201121 |
| As time | 49372 seconds = 13 h 42 min 52 s |
Is 49372 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49372 ÷ 2 = 24686) | 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 (49372 ÷ 4 = 12343) | 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 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 7) | 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 4) | 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 49372 a prime number?
No. 49372 = × 12343, so it is divisible by 2.
What are the factors of 49372?
1, 2, 4, 12343, 24686, 49372.
What is 49372 in binary?
1100000011011100 (hexadecimal C0DC, octal 140334).
What is the square root of 49372?
About 222.1981, exactly 2√12343.
Is 49372 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49372?
It is a composite number with 6 divisors.