The number 63460
63460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 19 × 167. Divisors (24): 1, 2, 4, 5, 10, 19, 20, 38, 76, 95, 167, 190, 334, 380, 668, 835 … 63460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63460: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.
- 2
63460 is composite. Its prime factorisation is
- 3
The divisors add up to 141120; without 63460 itself that is 77660, so 63460 is abundant (77660 is more than 63460). Euler's totient φ(63460) = 23904 numbers up to 63460 share no factor with it.
- 4
The digits of 63460 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63460 = 2^{2} \times 5 \times 19 \times 167 \]63460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 141120 |
| Euler totient φ(n) | 23904 |
| Square | 4027171600 |
| Cube | 255564309736000 |
| Square root | 251.912683 (= 2√15865) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.346 × |
63460 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand four hundred and sixty |
| Binary (base 2) | 1111011111100100 |
| Octal (base 8) | 173744 |
| Hexadecimal (base 16) | F7E4 |
| Base 3 | 10020001101 |
| As time | 63460 seconds = 17 h 37 min 40 s |
Is 63460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63460 ÷ 2 = 31730) | 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 | Yes (63460 ÷ 4 = 15865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63460 ÷ 5 = 12692) | 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 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (63460 ÷ 10 = 6346) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63460 a prime number?
No. 63460 = × 5 × 19 × 167, so it is divisible by 2.
What are the factors of 63460?
1, 2, 4, 5, 10, 19, 20, 38, 76, 95, 167, 190, 334, 380, 668, 835, 1670, 3173, 3340, 6346, 12692, 15865, 31730, 63460.
What is 63460 in binary?
1111011111100100 (hexadecimal F7E4, octal 173744).
What is the square root of 63460?
About 251.9127, exactly 2√15865.
Is 63460 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 63460?
63460 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.