The number 49251
49251 is a composite number with 4 divisors. Its prime factorisation is 3 × 16417. Divisors (4): 1, 3, 16417, 49251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49251: a semiprime: 3 × 16417, the product of two primes.
- 2
49251 is composite. Its prime factorisation is
- 3
The divisors add up to 65672; without 49251 itself that is 16421, so 49251 is deficient (16421 is less than 49251). Euler's totient φ(49251) = 32832 numbers up to 49251 share no factor with it.
- 4
The digits of 49251 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49251 = 3 \times 16417 \]
49251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65672 |
| Euler totient φ(n) | 32832 |
| Square | 2425661001 |
| Cube | 119466229960251 |
| Square root | 221.925663 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9251 × |
49251 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and fifty-one |
| Binary (base 2) | 1100000001100011 |
| Octal (base 8) | 140143 |
| Hexadecimal (base 16) | C063 |
| Base 3 | 2111120010 |
| As time | 49251 seconds = 13 h 40 min 51 s |
Is 49251 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 (49251 ÷ 3 = 16417) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 49251 a prime number?
No. 49251 = 3 × 16417, so it is divisible by 3.
What are the factors of 49251?
1, 3, 16417, 49251.
What is 49251 in binary?
1100000001100011 (hexadecimal C063, octal 140143).
What is the square root of 49251?
About 221.9257.
Is 49251 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49251?
49251 is a semiprime: 3 × 16417, the product of two primes.