The number 63395
63395 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 409. Divisors (8): 1, 5, 31, 155, 409, 2045, 12679, 63395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63395 is composite. Its prime factorisation is
- 3
The divisors add up to 78720; without 63395 itself that is 15325, so 63395 is deficient (15325 is less than 63395). Euler's totient φ(63395) = 48960 numbers up to 63395 share no factor with it.
- 4
The digits of 63395 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63395 = 5 \times 31 \times 409 \]
63395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78720 |
| Euler totient φ(n) | 48960 |
| Square | 4018926025 |
| Cube | 254779815354875 |
| Square root | 251.783637 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3395 × |
63395 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand three hundred and ninety-five |
| Binary (base 2) | 1111011110100011 |
| Octal (base 8) | 173643 |
| Hexadecimal (base 16) | F7A3 |
| Base 3 | 10012221222 |
| As time | 63395 seconds = 17 h 36 min 35 s |
Is 63395 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 (63395 ÷ 5 = 12679) | 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 3) | 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 8) | 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 2) | 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 63395 a prime number?
No. 63395 = 5 × 31 × 409, so it is divisible by 5.
What are the factors of 63395?
1, 5, 31, 155, 409, 2045, 12679, 63395.
What is 63395 in binary?
1111011110100011 (hexadecimal F7A3, octal 173643).
What is the square root of 63395?
About 251.7836.
Is 63395 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 63395?
It is a composite number with 8 divisors.