The number 49981
49981 is a composite number with 4 divisors. Its prime factorisation is 151 × 331. Divisors (4): 1, 151, 331, 49981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49981: a semiprime: 151 × 331, the product of two primes.
- 2
49981 is composite. Its prime factorisation is
- 3
The divisors add up to 50464; without 49981 itself that is 483, so 49981 is deficient (483 is less than 49981). Euler's totient φ(49981) = 49500 numbers up to 49981 share no factor with it.
- 4
The digits of 49981 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49981 = 151 \times 331 \]
49981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50464 |
| Euler totient φ(n) | 49500 |
| Square | 2498100361 |
| Cube | 124857554143141 |
| Square root | 223.564308 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9981 × |
49981 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and eighty-one |
| Binary (base 2) | 1100001100111101 |
| Octal (base 8) | 141475 |
| Hexadecimal (base 16) | C33D |
| Base 3 | 2112120011 |
| As time | 49981 seconds = 13 h 53 min 1 s |
Is 49981 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 1) | 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 | No (remainder 1) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49981 a prime number?
No. 49981 = 151 × 331, so it is divisible by 151.
What are the factors of 49981?
1, 151, 331, 49981.
What is 49981 in binary?
1100001100111101 (hexadecimal C33D, octal 141475).
What is the square root of 49981?
About 223.5643.
Is 49981 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49981?
49981 is a semiprime: 151 × 331, the product of two primes.