The number 48323
48323 is a composite number with 8 divisors. Its prime factorisation is 11 × 23 × 191. Divisors (8): 1, 11, 23, 191, 253, 2101, 4393, 48323.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48323 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48323 is composite. Its prime factorisation is
- 3
The divisors add up to 55296; without 48323 itself that is 6973, so 48323 is deficient (6973 is less than 48323). Euler's totient φ(48323) = 41800 numbers up to 48323 share no factor with it.
- 4
The digits of 48323 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48323 = 11 \times 23 \times 191 \]
48323 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55296 |
| Euler totient φ(n) | 41800 |
| Square | 2335112329 |
| Cube | 112839633074267 |
| Square root | 219.824930 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8323 × |
48323 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and twenty-three |
| Binary (base 2) | 1011110011000011 |
| Octal (base 8) | 136303 |
| Hexadecimal (base 16) | BCC3 |
| Base 3 | 2110021202 |
| As time | 48323 seconds = 13 h 25 min 23 s |
Is 48323 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 3) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48323 ÷ 11 = 4393) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48323 a prime number?
No. 48323 = 11 × 23 × 191, so it is divisible by 11.
What are the factors of 48323?
1, 11, 23, 191, 253, 2101, 4393, 48323.
What is 48323 in binary?
1011110011000011 (hexadecimal BCC3, octal 136303).
What is the square root of 48323?
About 219.8249.
Is 48323 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48323?
It is a composite number with 8 divisors.