The number 48309
48309 is a composite number with 4 divisors. Its prime factorisation is 3 × 16103. Divisors (4): 1, 3, 16103, 48309.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48309: a semiprime: 3 × 16103, the product of two primes.
- 2
48309 is composite. Its prime factorisation is
- 3
The divisors add up to 64416; without 48309 itself that is 16107, so 48309 is deficient (16107 is less than 48309). Euler's totient φ(48309) = 32204 numbers up to 48309 share no factor with it.
- 4
The digits of 48309 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48309 = 3 \times 16103 \]
48309 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64416 |
| Euler totient φ(n) | 32204 |
| Square | 2333759481 |
| Cube | 112741586767629 |
| Square root | 219.793085 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8309 × |
48309 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and nine |
| Binary (base 2) | 1011110010110101 |
| Octal (base 8) | 136265 |
| Hexadecimal (base 16) | BCB5 |
| Base 3 | 2110021020 |
| As time | 48309 seconds = 13 h 25 min 9 s |
Is 48309 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 | Yes (48309 ÷ 3 = 16103) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48309 a prime number?
No. 48309 = 3 × 16103, so it is divisible by 3.
What are the factors of 48309?
1, 3, 16103, 48309.
What is 48309 in binary?
1011110010110101 (hexadecimal BCB5, octal 136265).
What is the square root of 48309?
About 219.7931.
Is 48309 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 48309?
48309 is a semiprime: 3 × 16103, the product of two primes.