The number 49476
49476 is a composite number with 48 divisors. Its prime factorisation is × 3 × 7 × 19 × 31. Divisors (48): 1, 2, 3, 4, 6, 7, 12, 14, 19, 21, 28, 31, 38, 42, 57, 62 … 49476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49476 is composite. Its prime factorisation is
- 3
The divisors add up to 143360; without 49476 itself that is 93884, so 49476 is abundant (93884 is more than 49476). Euler's totient φ(49476) = 12960 numbers up to 49476 share no factor with it.
- 4
The digits of 49476 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49476 = 2^{2} \times 3 \times 7 \times 19 \times 31 \]49476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 143360 |
| Euler totient φ(n) | 12960 |
| Square | 2447874576 |
| Cube | 121111042522176 |
| Square root | 222.432012 (= 2√12369) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9476 × |
49476 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and seventy-six |
| Binary (base 2) | 1100000101000100 |
| Octal (base 8) | 140504 |
| Hexadecimal (base 16) | C144 |
| Base 3 | 2111212110 |
| As time | 49476 seconds = 13 h 44 min 36 s |
Is 49476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49476 ÷ 2 = 24738) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49476 ÷ 3 = 16492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49476 ÷ 4 = 12369) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49476 ÷ 6 = 8246) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49476 ÷ 7 = 7068) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49476 ÷ 12 = 4123) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49476 a prime number?
No. 49476 = × 3 × 7 × 19 × 31, so it is divisible by 2.
What are the factors of 49476?
1, 2, 3, 4, 6, 7, 12, 14, 19, 21, 28, 31, 38, 42, 57, 62, 76, 84, 93, 114, 124, 133, 186, 217, 228, 266, 372, 399, 434, 532, 589, 651, 798, 868, 1178, 1302, 1596, 1767, 2356, 2604, 3534, 4123, 7068, 8246, 12369, 16492, 24738, 49476.
What is 49476 in binary?
1100000101000100 (hexadecimal C144, octal 140504).
What is the square root of 49476?
About 222.4320, exactly 2√12369.
Is 49476 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49476?
It is a composite number with 48 divisors.