The number 47915
47915 is a composite number with 12 divisors. Its prime factorisation is 5 × 7 × . Divisors (12): 1, 5, 7, 35, 37, 185, 259, 1295, 1369, 6845, 9583, 47915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47915 is composite. Its prime factorisation is
- 3
The divisors add up to 67536; without 47915 itself that is 19621, so 47915 is deficient (19621 is less than 47915). Euler's totient φ(47915) = 31968 numbers up to 47915 share no factor with it.
- 4
The digits of 47915 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47915 = 5 \times 7 \times 37^{2} \]47915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 67536 |
| Euler totient φ(n) | 31968 |
| Square | 2295847225 |
| Cube | 110005519785875 |
| Square root | 218.894952 (= 37√35) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.7915 × |
47915 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifteen |
| Binary (base 2) | 1011101100101011 |
| Octal (base 8) | 135453 |
| Hexadecimal (base 16) | BB2B |
| Base 3 | 2102201122 |
| As time | 47915 seconds = 13 h 18 min 35 s |
Is 47915 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (47915 ÷ 5 = 9583) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (47915 ÷ 7 = 6845) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47915 a prime number?
No. 47915 = 5 × 7 × , so it is divisible by 5.
What are the factors of 47915?
1, 5, 7, 35, 37, 185, 259, 1295, 1369, 6845, 9583, 47915.
What is 47915 in binary?
1011101100101011 (hexadecimal BB2B, octal 135453).
What is the square root of 47915?
About 218.8950, exactly 37√35.
Is 47915 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 47915?
It is a composite number with 12 divisors.