The number 48306
48306 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 83 × 97. Divisors (16): 1, 2, 3, 6, 83, 97, 166, 194, 249, 291, 498, 582, 8051, 16102, 24153, 48306.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48306 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48306 is composite. Its prime factorisation is
- 3
The divisors add up to 98784; without 48306 itself that is 50478, so 48306 is abundant (50478 is more than 48306). Euler's totient φ(48306) = 15744 numbers up to 48306 share no factor with it.
- 4
The digits of 48306 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48306 = 2 \times 3 \times 83 \times 97 \]
48306 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98784 |
| Euler totient φ(n) | 15744 |
| Square | 2333469636 |
| Cube | 112720584236616 |
| Square root | 219.786260 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.8306 × |
48306 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and six |
| Binary (base 2) | 1011110010110010 |
| Octal (base 8) | 136262 |
| Hexadecimal (base 16) | BCB2 |
| Base 3 | 2110021010 |
| As time | 48306 seconds = 13 h 25 min 6 s |
Is 48306 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48306 ÷ 2 = 24153) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48306 ÷ 3 = 16102) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (48306 ÷ 6 = 8051) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48306 a prime number?
No. 48306 = 2 × 3 × 83 × 97, so it is divisible by 2.
What are the factors of 48306?
1, 2, 3, 6, 83, 97, 166, 194, 249, 291, 498, 582, 8051, 16102, 24153, 48306.
What is 48306 in binary?
1011110010110010 (hexadecimal BCB2, octal 136262).
What is the square root of 48306?
About 219.7863.
Is 48306 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48306?
It is a composite number with 16 divisors.