The number 47301
47301 is a composite number with 4 divisors. Its prime factorisation is 3 × 15767. Divisors (4): 1, 3, 15767, 47301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47301: a semiprime: 3 × 15767, the product of two primes.
- 2
47301 is composite. Its prime factorisation is
- 3
The divisors add up to 63072; without 47301 itself that is 15771, so 47301 is deficient (15771 is less than 47301). Euler's totient φ(47301) = 31532 numbers up to 47301 share no factor with it.
- 4
The digits of 47301 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47301 = 3 \times 15767 \]
47301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63072 |
| Euler totient φ(n) | 31532 |
| Square | 2237384601 |
| Cube | 105830529011901 |
| Square root | 217.487931 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7301 × |
47301 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand three hundred and one |
| Binary (base 2) | 1011100011000101 |
| Octal (base 8) | 134305 |
| Hexadecimal (base 16) | B8C5 |
| Base 3 | 2101212220 |
| As time | 47301 seconds = 13 h 8 min 21 s |
Is 47301 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 (47301 ÷ 3 = 15767) | 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 1) | 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 47301 a prime number?
No. 47301 = 3 × 15767, so it is divisible by 3.
What are the factors of 47301?
1, 3, 15767, 47301.
What is 47301 in binary?
1011100011000101 (hexadecimal B8C5, octal 134305).
What is the square root of 47301?
About 217.4879.
Is 47301 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 47301?
47301 is a semiprime: 3 × 15767, the product of two primes.