The number 49479
49479 is a composite number with 4 divisors. Its prime factorisation is 3 × 16493. Divisors (4): 1, 3, 16493, 49479.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49479: a semiprime: 3 × 16493, the product of two primes.
- 2
49479 is composite. Its prime factorisation is
- 3
The divisors add up to 65976; without 49479 itself that is 16497, so 49479 is deficient (16497 is less than 49479). Euler's totient φ(49479) = 32984 numbers up to 49479 share no factor with it.
- 4
The digits of 49479 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49479 = 3 \times 16493 \]
49479 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65976 |
| Euler totient φ(n) | 32984 |
| Square | 2448171441 |
| Cube | 121133074729239 |
| Square root | 222.438756 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9479 × |
49479 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and seventy-nine |
| Binary (base 2) | 1100000101000111 |
| Octal (base 8) | 140507 |
| Hexadecimal (base 16) | C147 |
| Base 3 | 2111212120 |
| As time | 49479 seconds = 13 h 44 min 39 s |
Is 49479 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49479 ÷ 3 = 16493) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49479 a prime number?
No. 49479 = 3 × 16493, so it is divisible by 3.
What are the factors of 49479?
1, 3, 16493, 49479.
What is 49479 in binary?
1100000101000111 (hexadecimal C147, octal 140507).
What is the square root of 49479?
About 222.4388.
Is 49479 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49479?
49479 is a semiprime: 3 × 16493, the product of two primes.