The number 48971
48971 is a composite number with 4 divisors. Its prime factorisation is 13 × 3767. Divisors (4): 1, 13, 3767, 48971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48971: a semiprime: 13 × 3767, the product of two primes.
- 2
48971 is composite. Its prime factorisation is
- 3
The divisors add up to 52752; without 48971 itself that is 3781, so 48971 is deficient (3781 is less than 48971). Euler's totient φ(48971) = 45192 numbers up to 48971 share no factor with it.
- 4
The digits of 48971 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48971 = 13 \times 3767 \]
48971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52752 |
| Euler totient φ(n) | 45192 |
| Square | 2398158841 |
| Cube | 117440236602611 |
| Square root | 221.293922 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8971 × |
48971 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and seventy-one |
| Binary (base 2) | 1011111101001011 |
| Octal (base 8) | 137513 |
| Hexadecimal (base 16) | BF4B |
| Base 3 | 2111011202 |
| As time | 48971 seconds = 13 h 36 min 11 s |
Is 48971 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 | No (remainder 1) | 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 | No (remainder 6) | 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 2) | 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 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 48971 a prime number?
No. 48971 = 13 × 3767, so it is divisible by 13.
What are the factors of 48971?
1, 13, 3767, 48971.
What is 48971 in binary?
1011111101001011 (hexadecimal BF4B, octal 137513).
What is the square root of 48971?
About 221.2939.
Is 48971 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48971?
48971 is a semiprime: 13 × 3767, the product of two primes.