The number 48308
48308 is a composite number with 12 divisors. Its prime factorisation is × 13 × 929. Divisors (12): 1, 2, 4, 13, 26, 52, 929, 1858, 3716, 12077, 24154, 48308.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48308 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48308 is composite. Its prime factorisation is
- 3
The divisors add up to 91140; without 48308 itself that is 42832, so 48308 is deficient (42832 is less than 48308). Euler's totient φ(48308) = 22272 numbers up to 48308 share no factor with it.
- 4
The digits of 48308 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48308 = 2^{2} \times 13 \times 929 \]48308 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91140 |
| Euler totient φ(n) | 22272 |
| Square | 2333662864 |
| Cube | 112734585634112 |
| Square root | 219.790810 (= 2√12077) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8308 × |
48308 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and eight |
| Binary (base 2) | 1011110010110100 |
| Octal (base 8) | 136264 |
| Hexadecimal (base 16) | BCB4 |
| Base 3 | 2110021012 |
| As time | 48308 seconds = 13 h 25 min 8 s |
Is 48308 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48308 ÷ 2 = 24154) | 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 | Yes (48308 ÷ 4 = 12077) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48308 a prime number?
No. 48308 = × 13 × 929, so it is divisible by 2.
What are the factors of 48308?
1, 2, 4, 13, 26, 52, 929, 1858, 3716, 12077, 24154, 48308.
What is 48308 in binary?
1011110010110100 (hexadecimal BCB4, octal 136264).
What is the square root of 48308?
About 219.7908, exactly 2√12077.
Is 48308 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48308?
It is a composite number with 12 divisors.