The number 48931
48931 is a composite number with 4 divisors. Its prime factorisation is 167 × 293. Divisors (4): 1, 167, 293, 48931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48931: a semiprime: 167 × 293, the product of two primes.
- 2
48931 is composite. Its prime factorisation is
- 3
The divisors add up to 49392; without 48931 itself that is 461, so 48931 is deficient (461 is less than 48931). Euler's totient φ(48931) = 48472 numbers up to 48931 share no factor with it.
- 4
The digits of 48931 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48931 = 167 \times 293 \]
48931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49392 |
| Euler totient φ(n) | 48472 |
| Square | 2394242761 |
| Cube | 117152692538491 |
| Square root | 221.203526 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8931 × |
48931 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-one |
| Binary (base 2) | 1011111100100011 |
| Octal (base 8) | 137443 |
| Hexadecimal (base 16) | BF23 |
| Base 3 | 2111010021 |
| As time | 48931 seconds = 13 h 35 min 31 s |
Is 48931 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 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 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48931 a prime number?
No. 48931 = 167 × 293, so it is divisible by 167.
What are the factors of 48931?
1, 167, 293, 48931.
What is 48931 in binary?
1011111100100011 (hexadecimal BF23, octal 137443).
What is the square root of 48931?
About 221.2035.
Is 48931 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48931?
48931 is a semiprime: 167 × 293, the product of two primes.