The number 49879
49879 is a composite number with 4 divisors. Its prime factorisation is 31 × 1609. Divisors (4): 1, 31, 1609, 49879.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49879: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1609, the product of two primes.
- 2
49879 is composite. Its prime factorisation is
- 3
The divisors add up to 51520; without 49879 itself that is 1641, so 49879 is deficient (1641 is less than 49879). Euler's totient φ(49879) = 48240 numbers up to 49879 share no factor with it.
- 4
The digits of 49879 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49879 = 31 \times 1609 \]
49879 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51520 |
| Euler totient φ(n) | 48240 |
| Square | 2487914641 |
| Cube | 124094694378439 |
| Square root | 223.336070 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9879 × |
49879 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand eight hundred and seventy-nine |
| Binary (base 2) | 1100001011010111 |
| Octal (base 8) | 141327 |
| Hexadecimal (base 16) | C2D7 |
| Base 3 | 2112102101 |
| As time | 49879 seconds = 13 h 51 min 19 s |
Is 49879 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49879 a prime number?
No. 49879 = 31 × 1609, so it is divisible by 31.
What are the factors of 49879?
1, 31, 1609, 49879.
What is 49879 in binary?
1100001011010111 (hexadecimal C2D7, octal 141327).
What is the square root of 49879?
About 223.3361.
Is 49879 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 49879?
49879 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1609, the product of two primes.