The number 47001
47001 is a composite number with 4 divisors. Its prime factorisation is 3 × 15667. Divisors (4): 1, 3, 15667, 47001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47001: a semiprime: 3 × 15667, the product of two primes.
- 2
47001 is composite. Its prime factorisation is
- 3
The divisors add up to 62672; without 47001 itself that is 15671, so 47001 is deficient (15671 is less than 47001). Euler's totient φ(47001) = 31332 numbers up to 47001 share no factor with it.
- 4
The digits of 47001 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47001 = 3 \times 15667 \]
47001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62672 |
| Euler totient φ(n) | 31332 |
| Square | 2209094001 |
| Cube | 103829627141001 |
| Square root | 216.797140 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7001 × |
47001 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand and one |
| Binary (base 2) | 1011011110011001 |
| Octal (base 8) | 133631 |
| Hexadecimal (base 16) | B799 |
| Base 3 | 2101110210 |
| As time | 47001 seconds = 13 h 3 min 21 s |
Is 47001 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 (47001 ÷ 3 = 15667) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47001 a prime number?
No. 47001 = 3 × 15667, so it is divisible by 3.
What are the factors of 47001?
1, 3, 15667, 47001.
What is 47001 in binary?
1011011110011001 (hexadecimal B799, octal 133631).
What is the square root of 47001?
About 216.7971.
Is 47001 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 47001?
47001 is a semiprime: 3 × 15667, the product of two primes.