The number 47913
47913 is a composite number with 4 divisors. Its prime factorisation is 3 × 15971. Divisors (4): 1, 3, 15971, 47913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47913: a semiprime: 3 × 15971, the product of two primes.
- 2
47913 is composite. Its prime factorisation is
- 3
The divisors add up to 63888; without 47913 itself that is 15975, so 47913 is deficient (15975 is less than 47913). Euler's totient φ(47913) = 31940 numbers up to 47913 share no factor with it.
- 4
The digits of 47913 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47913 = 3 \times 15971 \]
47913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63888 |
| Euler totient φ(n) | 31940 |
| Square | 2295655569 |
| Cube | 109991745277497 |
| Square root | 218.890384 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7913 × |
47913 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and thirteen |
| Binary (base 2) | 1011101100101001 |
| Octal (base 8) | 135451 |
| Hexadecimal (base 16) | BB29 |
| Base 3 | 2102201120 |
| As time | 47913 seconds = 13 h 18 min 33 s |
Is 47913 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 (47913 ÷ 3 = 15971) | 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 5) | 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 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 8) | 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 47913 a prime number?
No. 47913 = 3 × 15971, so it is divisible by 3.
What are the factors of 47913?
1, 3, 15971, 47913.
What is 47913 in binary?
1011101100101001 (hexadecimal BB29, octal 135451).
What is the square root of 47913?
About 218.8904.
Is 47913 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 47913?
47913 is a semiprime: 3 × 15971, the product of two primes.