The number 47013
47013 is a composite number with 4 divisors. Its prime factorisation is 3 × 15671. Divisors (4): 1, 3, 15671, 47013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47013: a semiprime: 3 × 15671, the product of two primes.
- 2
47013 is composite. Its prime factorisation is
- 3
The divisors add up to 62688; without 47013 itself that is 15675, so 47013 is deficient (15675 is less than 47013). Euler's totient φ(47013) = 31340 numbers up to 47013 share no factor with it.
- 4
The digits of 47013 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47013 = 3 \times 15671 \]
47013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62688 |
| Euler totient φ(n) | 31340 |
| Square | 2210222169 |
| Cube | 103909174831197 |
| Square root | 216.824814 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.7013 × |
47013 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand and thirteen |
| Binary (base 2) | 1011011110100101 |
| Octal (base 8) | 133645 |
| Hexadecimal (base 16) | B7A5 |
| Base 3 | 2101111020 |
| As time | 47013 seconds = 13 h 3 min 33 s |
Is 47013 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 (47013 ÷ 3 = 15671) | 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 3) | 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 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47013 a prime number?
No. 47013 = 3 × 15671, so it is divisible by 3.
What are the factors of 47013?
1, 3, 15671, 47013.
What is 47013 in binary?
1011011110100101 (hexadecimal B7A5, octal 133645).
What is the square root of 47013?
About 216.8248.
Is 47013 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 47013?
47013 is a semiprime: 3 × 15671, the product of two primes.