The number 48913
48913 is a composite number with 4 divisors. Its prime factorisation is 41 × 1193. Divisors (4): 1, 41, 1193, 48913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48913: a semiprime: 41 × 1193, the product of two primes.
- 2
48913 is composite. Its prime factorisation is
- 3
The divisors add up to 50148; without 48913 itself that is 1235, so 48913 is deficient (1235 is less than 48913). Euler's totient φ(48913) = 47680 numbers up to 48913 share no factor with it.
- 4
The digits of 48913 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48913 = 41 \times 1193 \]
48913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50148 |
| Euler totient φ(n) | 47680 |
| Square | 2392481569 |
| Cube | 117023450984497 |
| Square root | 221.162836 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8913 × |
48913 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirteen |
| Binary (base 2) | 1011111100010001 |
| Octal (base 8) | 137421 |
| Hexadecimal (base 16) | BF11 |
| Base 3 | 2111002121 |
| As time | 48913 seconds = 13 h 35 min 13 s |
Is 48913 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 | No (remainder 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 48913 a prime number?
No. 48913 = 41 × 1193, so it is divisible by 41.
What are the factors of 48913?
1, 41, 1193, 48913.
What is 48913 in binary?
1011111100010001 (hexadecimal BF11, octal 137421).
What is the square root of 48913?
About 221.1628.
Is 48913 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48913?
48913 is a semiprime: 41 × 1193, the product of two primes.