The number 48351
48351 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 227. Divisors (8): 1, 3, 71, 213, 227, 681, 16117, 48351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48351 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48351 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 48351 itself that is 17313, so 48351 is deficient (17313 is less than 48351). Euler's totient φ(48351) = 31640 numbers up to 48351 share no factor with it.
- 4
The digits of 48351 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
\[ 48351 = 3 \times 71 \times 227 \]
48351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65664 |
| Euler totient φ(n) | 31640 |
| Square | 2337819201 |
| Cube | 113035896187551 |
| Square root | 219.888608 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.8351 × |
48351 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and fifty-one |
| Binary (base 2) | 1011110011011111 |
| Octal (base 8) | 136337 |
| Hexadecimal (base 16) | BCDF |
| Base 3 | 2110022210 |
| As time | 48351 seconds = 13 h 25 min 51 s |
Is 48351 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 | Yes (48351 ÷ 3 = 16117) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48351 a prime number?
No. 48351 = 3 × 71 × 227, so it is divisible by 3.
What are the factors of 48351?
1, 3, 71, 213, 227, 681, 16117, 48351.
What is 48351 in binary?
1011110011011111 (hexadecimal BCDF, octal 136337).
What is the square root of 48351?
About 219.8886.
Is 48351 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48351?
It is a composite number with 8 divisors.