The number 48329
48329 is a composite number with 4 divisors. Its prime factorisation is 31 × 1559. Divisors (4): 1, 31, 1559, 48329.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48329: a semiprime: 31 × 1559, the product of two primes.
- 2
48329 is composite. Its prime factorisation is
- 3
The divisors add up to 49920; without 48329 itself that is 1591, so 48329 is deficient (1591 is less than 48329). Euler's totient φ(48329) = 46740 numbers up to 48329 share no factor with it.
- 4
The digits of 48329 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48329 = 31 \times 1559 \]
48329 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49920 |
| Euler totient φ(n) | 46740 |
| Square | 2335692241 |
| Cube | 112881670315289 |
| Square root | 219.838577 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8329 × |
48329 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and twenty-nine |
| Binary (base 2) | 1011110011001001 |
| Octal (base 8) | 136311 |
| Hexadecimal (base 16) | BCC9 |
| Base 3 | 2110021222 |
| As time | 48329 seconds = 13 h 25 min 29 s |
Is 48329 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 1) | 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 5) | 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 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48329 a prime number?
No. 48329 = 31 × 1559, so it is divisible by 31.
What are the factors of 48329?
1, 31, 1559, 48329.
What is 48329 in binary?
1011110011001001 (hexadecimal BCC9, octal 136311).
What is the square root of 48329?
About 219.8386.
Is 48329 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48329?
48329 is a semiprime: 31 × 1559, the product of two primes.