The number 49491
49491 is a composite number with 20 divisors. Its prime factorisation is × 13 × 47. Divisors (20): 1, 3, 9, 13, 27, 39, 47, 81, 117, 141, 351, 423, 611, 1053, 1269, 1833 … 49491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49491: a Harshad number: divisible by its digit sum 27.
- 2
49491 is composite. Its prime factorisation is
- 3
The divisors add up to 81312; without 49491 itself that is 31821, so 49491 is deficient (31821 is less than 49491). Euler's totient φ(49491) = 29808 numbers up to 49491 share no factor with it.
- 4
The digits of 49491 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49491 = 3^{4} \times 13 \times 47 \]49491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 81312 |
| Euler totient φ(n) | 29808 |
| Square | 2449359081 |
| Cube | 121221230277771 |
| Square root | 222.465728 (= 9√611) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9491 × |
49491 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and ninety-one |
| Binary (base 2) | 1100000101010011 |
| Octal (base 8) | 140523 |
| Hexadecimal (base 16) | C153 |
| Base 3 | 2111220000 |
| As time | 49491 seconds = 13 h 44 min 51 s |
Is 49491 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 (49491 ÷ 3 = 16497) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49491 ÷ 9 = 5499) | 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 2) | 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 49491 a prime number?
No. 49491 = × 13 × 47, so it is divisible by 3.
What are the factors of 49491?
1, 3, 9, 13, 27, 39, 47, 81, 117, 141, 351, 423, 611, 1053, 1269, 1833, 3807, 5499, 16497, 49491.
What is 49491 in binary?
1100000101010011 (hexadecimal C153, octal 140523).
What is the square root of 49491?
About 222.4657, exactly 9√611.
Is 49491 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49491?
49491 is a Harshad number: divisible by its digit sum 27.