The number 47905
47905 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 67. Divisors (16): 1, 5, 11, 13, 55, 65, 67, 143, 335, 715, 737, 871, 3685, 4355, 9581, 47905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47905 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47905 is composite. Its prime factorisation is
- 3
The divisors add up to 68544; without 47905 itself that is 20639, so 47905 is deficient (20639 is less than 47905). Euler's totient φ(47905) = 31680 numbers up to 47905 share no factor with it.
- 4
The digits of 47905 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47905 = 5 \times 11 \times 13 \times 67 \]
47905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 68544 |
| Euler totient φ(n) | 31680 |
| Square | 2294889025 |
| Cube | 109936658742625 |
| Square root | 218.872109 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7905 × |
47905 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and five |
| Binary (base 2) | 1011101100100001 |
| Octal (base 8) | 135441 |
| Hexadecimal (base 16) | BB21 |
| Base 3 | 2102201021 |
| As time | 47905 seconds = 13 h 18 min 25 s |
Is 47905 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (47905 ÷ 5 = 9581) | 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 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (47905 ÷ 11 = 4355) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47905 a prime number?
No. 47905 = 5 × 11 × 13 × 67, so it is divisible by 5.
What are the factors of 47905?
1, 5, 11, 13, 55, 65, 67, 143, 335, 715, 737, 871, 3685, 4355, 9581, 47905.
What is 47905 in binary?
1011101100100001 (hexadecimal BB21, octal 135441).
What is the square root of 47905?
About 218.8721.
Is 47905 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47905?
It is a composite number with 16 divisors.