The number 63105
63105 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 601. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 601, 1803, 3005, 4207, 9015, 12621, 21035, 63105.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63105: a Harshad number: divisible by its digit sum 15.
- 2
63105 is composite. Its prime factorisation is
- 3
The divisors add up to 115584; without 63105 itself that is 52479, so 63105 is deficient (52479 is less than 63105). Euler's totient φ(63105) = 28800 numbers up to 63105 share no factor with it.
- 4
The digits of 63105 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 316 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63105 = 3 \times 5 \times 7 \times 601 \]
63105 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 115584 |
| Euler totient φ(n) | 28800 |
| Square | 3982241025 |
| Cube | 251299319882625 |
| Square root | 251.207086 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 316 |
| Scientific notation | 6.3105 × |
63105 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand one hundred and five |
| Binary (base 2) | 1111011010000001 |
| Octal (base 8) | 173201 |
| Hexadecimal (base 16) | F681 |
| Base 3 | 10012120020 |
| As time | 63105 seconds = 17 h 31 min 45 s |
Is 63105 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 (63105 ÷ 3 = 21035) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63105 ÷ 5 = 12621) | 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 | Yes (63105 ÷ 7 = 9015) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63105 a prime number?
No. 63105 = 3 × 5 × 7 × 601, so it is divisible by 3.
What are the factors of 63105?
1, 3, 5, 7, 15, 21, 35, 105, 601, 1803, 3005, 4207, 9015, 12621, 21035, 63105.
What is 63105 in binary?
1111011010000001 (hexadecimal F681, octal 173201).
What is the square root of 63105?
About 251.2071.
Is 63105 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 63105?
63105 is a Harshad number: divisible by its digit sum 15.