The number 48919
48919 is a composite number with 8 divisors. Its prime factorisation is 13 × 53 × 71. Divisors (8): 1, 13, 53, 71, 689, 923, 3763, 48919.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48919 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48919 is composite. Its prime factorisation is
- 3
The divisors add up to 54432; without 48919 itself that is 5513, so 48919 is deficient (5513 is less than 48919). Euler's totient φ(48919) = 43680 numbers up to 48919 share no factor with it.
- 4
The digits of 48919 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48919 = 13 \times 53 \times 71 \]
48919 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54432 |
| Euler totient φ(n) | 43680 |
| Square | 2393068561 |
| Cube | 117066520935559 |
| Square root | 221.176400 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8919 × |
48919 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and nineteen |
| Binary (base 2) | 1011111100010111 |
| Octal (base 8) | 137427 |
| Hexadecimal (base 16) | BF17 |
| Base 3 | 2111002211 |
| As time | 48919 seconds = 13 h 35 min 19 s |
Is 48919 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 4) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 48919 a prime number?
No. 48919 = 13 × 53 × 71, so it is divisible by 13.
What are the factors of 48919?
1, 13, 53, 71, 689, 923, 3763, 48919.
What is 48919 in binary?
1011111100010111 (hexadecimal BF17, octal 137427).
What is the square root of 48919?
About 221.1764.
Is 48919 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48919?
It is a composite number with 8 divisors.