The number 49167
49167 is a composite number with 10 divisors. Its prime factorisation is × 607. Divisors (10): 1, 3, 9, 27, 81, 607, 1821, 5463, 16389, 49167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49167: a Harshad number: divisible by its digit sum 27.
- 2
49167 is composite. Its prime factorisation is
- 3
The divisors add up to 73568; without 49167 itself that is 24401, so 49167 is deficient (24401 is less than 49167). Euler's totient φ(49167) = 32724 numbers up to 49167 share no factor with it.
- 4
The digits of 49167 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49167 = 3^{4} \times 607 \]49167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 73568 |
| Euler totient φ(n) | 32724 |
| Square | 2417393889 |
| Cube | 118856005340463 |
| Square root | 221.736330 (= 9√607) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9167 × |
49167 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and sixty-seven |
| Binary (base 2) | 1100000000001111 |
| Octal (base 8) | 140017 |
| Hexadecimal (base 16) | C00F |
| Base 3 | 2111110000 |
| As time | 49167 seconds = 13 h 39 min 27 s |
Is 49167 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 (49167 ÷ 3 = 16389) | 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49167 ÷ 9 = 5463) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49167 a prime number?
No. 49167 = × 607, so it is divisible by 3.
What are the factors of 49167?
1, 3, 9, 27, 81, 607, 1821, 5463, 16389, 49167.
What is 49167 in binary?
1100000000001111 (hexadecimal C00F, octal 140017).
What is the square root of 49167?
About 221.7363, exactly 9√607.
Is 49167 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49167?
49167 is a Harshad number: divisible by its digit sum 27.