The number 63462
63462 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 1511. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 1511, 3022, 4533, 9066, 10577, 21154, 31731, 63462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63462: a Harshad number: divisible by its digit sum 21.
- 2
63462 is composite. Its prime factorisation is
- 3
The divisors add up to 145152; without 63462 itself that is 81690, so 63462 is abundant (81690 is more than 63462). Euler's totient φ(63462) = 18120 numbers up to 63462 share no factor with it.
- 4
The digits of 63462 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63462 = 2 \times 3 \times 7 \times 1511 \]
63462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 145152 |
| Euler totient φ(n) | 18120 |
| Square | 4027425444 |
| Cube | 255588473527128 |
| Square root | 251.916653 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.3462 × |
63462 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand four hundred and sixty-two |
| Binary (base 2) | 1111011111100110 |
| Octal (base 8) | 173746 |
| Hexadecimal (base 16) | F7E6 |
| Base 3 | 10020001110 |
| As time | 63462 seconds = 17 h 37 min 42 s |
Is 63462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63462 ÷ 2 = 31731) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (63462 ÷ 3 = 21154) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (63462 ÷ 6 = 10577) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (63462 ÷ 7 = 9066) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63462 a prime number?
No. 63462 = 2 × 3 × 7 × 1511, so it is divisible by 2.
What are the factors of 63462?
1, 2, 3, 6, 7, 14, 21, 42, 1511, 3022, 4533, 9066, 10577, 21154, 31731, 63462.
What is 63462 in binary?
1111011111100110 (hexadecimal F7E6, octal 173746).
What is the square root of 63462?
About 251.9167.
Is 63462 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 63462?
63462 is a Harshad number: divisible by its digit sum 21.