The number 48343
48343 is a composite number with 4 divisors. Its prime factorisation is 29 × 1667. Divisors (4): 1, 29, 1667, 48343.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48343: a semiprime: 29 × 1667, the product of two primes.
- 2
48343 is composite. Its prime factorisation is
- 3
The divisors add up to 50040; without 48343 itself that is 1697, so 48343 is deficient (1697 is less than 48343). Euler's totient φ(48343) = 46648 numbers up to 48343 share no factor with it.
- 4
The digits of 48343 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48343 = 29 \times 1667 \]
48343 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50040 |
| Euler totient φ(n) | 46648 |
| Square | 2337045649 |
| Cube | 112979797809607 |
| Square root | 219.870416 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8343 × |
48343 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and forty-three |
| Binary (base 2) | 1011110011010111 |
| Octal (base 8) | 136327 |
| Hexadecimal (base 16) | BCD7 |
| Base 3 | 2110022111 |
| As time | 48343 seconds = 13 h 25 min 43 s |
Is 48343 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 1) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48343 a prime number?
No. 48343 = 29 × 1667, so it is divisible by 29.
What are the factors of 48343?
1, 29, 1667, 48343.
What is 48343 in binary?
1011110011010111 (hexadecimal BCD7, octal 136327).
What is the square root of 48343?
About 219.8704.
Is 48343 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48343?
48343 is a semiprime: 29 × 1667, the product of two primes.