The number 48335
48335 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1381. Divisors (8): 1, 5, 7, 35, 1381, 6905, 9667, 48335.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48335 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48335 is composite. Its prime factorisation is
- 3
The divisors add up to 66336; without 48335 itself that is 18001, so 48335 is deficient (18001 is less than 48335). Euler's totient φ(48335) = 33120 numbers up to 48335 share no factor with it.
- 4
The digits of 48335 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48335 = 5 \times 7 \times 1381 \]
48335 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66336 |
| Euler totient φ(n) | 33120 |
| Square | 2336272225 |
| Cube | 112923717995375 |
| Square root | 219.852223 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8335 × |
48335 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and thirty-five |
| Binary (base 2) | 1011110011001111 |
| Octal (base 8) | 136317 |
| Hexadecimal (base 16) | BCCF |
| Base 3 | 2110022012 |
| As time | 48335 seconds = 13 h 25 min 35 s |
Is 48335 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 | Yes (48335 ÷ 5 = 9667) | 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 | Yes (48335 ÷ 7 = 6905) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48335 a prime number?
No. 48335 = 5 × 7 × 1381, so it is divisible by 5.
What are the factors of 48335?
1, 5, 7, 35, 1381, 6905, 9667, 48335.
What is 48335 in binary?
1011110011001111 (hexadecimal BCCF, octal 136317).
What is the square root of 48335?
About 219.8522.
Is 48335 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48335?
It is a composite number with 8 divisors.