The number 48346
48346 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1051. Divisors (8): 1, 2, 23, 46, 1051, 2102, 24173, 48346.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48346 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48346 is composite. Its prime factorisation is
- 3
The divisors add up to 75744; without 48346 itself that is 27398, so 48346 is deficient (27398 is less than 48346). Euler's totient φ(48346) = 23100 numbers up to 48346 share no factor with it.
- 4
The digits of 48346 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48346 = 2 \times 23 \times 1051 \]
48346 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75744 |
| Euler totient φ(n) | 23100 |
| Square | 2337335716 |
| Cube | 113000832525736 |
| Square root | 219.877238 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8346 × |
48346 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and forty-six |
| Binary (base 2) | 1011110011011010 |
| Octal (base 8) | 136332 |
| Hexadecimal (base 16) | BCDA |
| Base 3 | 2110022121 |
| As time | 48346 seconds = 13 h 25 min 46 s |
Is 48346 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48346 ÷ 2 = 24173) | 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 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48346 a prime number?
No. 48346 = 2 × 23 × 1051, so it is divisible by 2.
What are the factors of 48346?
1, 2, 23, 46, 1051, 2102, 24173, 48346.
What is 48346 in binary?
1011110011011010 (hexadecimal BCDA, octal 136332).
What is the square root of 48346?
About 219.8772.
Is 48346 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48346?
It is a composite number with 8 divisors.