The number 49631
49631 is a composite number with 4 divisors. Its prime factorisation is 31 × 1601. Divisors (4): 1, 31, 1601, 49631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49631: a semiprime: 31 × 1601, the product of two primes.
- 2
49631 is composite. Its prime factorisation is
- 3
The divisors add up to 51264; without 49631 itself that is 1633, so 49631 is deficient (1633 is less than 49631). Euler's totient φ(49631) = 48000 numbers up to 49631 share no factor with it.
- 4
The digits of 49631 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49631 = 31 \times 1601 \]
49631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51264 |
| Euler totient φ(n) | 48000 |
| Square | 2463236161 |
| Cube | 122252873906591 |
| Square root | 222.780161 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9631 × |
49631 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and thirty-one |
| Binary (base 2) | 1100000111011111 |
| Octal (base 8) | 140737 |
| Hexadecimal (base 16) | C1DF |
| Base 3 | 2112002012 |
| As time | 49631 seconds = 13 h 47 min 11 s |
Is 49631 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49631 a prime number?
No. 49631 = 31 × 1601, so it is divisible by 31.
What are the factors of 49631?
1, 31, 1601, 49631.
What is 49631 in binary?
1100000111011111 (hexadecimal C1DF, octal 140737).
What is the square root of 49631?
About 222.7802.
Is 49631 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49631?
49631 is a semiprime: 31 × 1601, the product of two primes.