The number 47167
47167 is a composite number with 4 divisors. Its prime factorisation is 101 × 467. Divisors (4): 1, 101, 467, 47167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47167: a semiprime: 101 × 467, the product of two primes.
- 2
47167 is composite. Its prime factorisation is
- 3
The divisors add up to 47736; without 47167 itself that is 569, so 47167 is deficient (569 is less than 47167). Euler's totient φ(47167) = 46600 numbers up to 47167 share no factor with it.
- 4
The digits of 47167 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47167 = 101 \times 467 \]
47167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47736 |
| Euler totient φ(n) | 46600 |
| Square | 2224725889 |
| Cube | 104933646006463 |
| Square root | 217.179649 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7167 × |
47167 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand one hundred and sixty-seven |
| Binary (base 2) | 1011100000111111 |
| Octal (base 8) | 134077 |
| Hexadecimal (base 16) | B83F |
| Base 3 | 2101200221 |
| As time | 47167 seconds = 13 h 6 min 7 s |
Is 47167 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 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47167 a prime number?
No. 47167 = 101 × 467, so it is divisible by 101.
What are the factors of 47167?
1, 101, 467, 47167.
What is 47167 in binary?
1011100000111111 (hexadecimal B83F, octal 134077).
What is the square root of 47167?
About 217.1796.
Is 47167 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47167?
47167 is a semiprime: 101 × 467, the product of two primes.