The number 63428
63428 is a composite number with 12 divisors. Its prime factorisation is × 101 × 157. Divisors (12): 1, 2, 4, 101, 157, 202, 314, 404, 628, 15857, 31714, 63428.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63428: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
63428 is composite. Its prime factorisation is
- 3
The divisors add up to 112812; without 63428 itself that is 49384, so 63428 is deficient (49384 is less than 63428). Euler's totient φ(63428) = 31200 numbers up to 63428 share no factor with it.
- 4
The digits of 63428 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63428 = 2^{2} \times 101 \times 157 \]63428 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 112812 |
| Euler totient φ(n) | 31200 |
| Square | 4023111184 |
| Cube | 255177896178752 |
| Square root | 251.849161 (= 2√15857) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 104 |
| Scientific notation | 6.3428 × |
63428 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand four hundred and twenty-eight |
| Binary (base 2) | 1111011111000100 |
| Octal (base 8) | 173704 |
| Hexadecimal (base 16) | F7C4 |
| Base 3 | 10020000012 |
| As time | 63428 seconds = 17 h 37 min 8 s |
Is 63428 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63428 ÷ 2 = 31714) | 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 | Yes (63428 ÷ 4 = 15857) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63428 a prime number?
No. 63428 = × 101 × 157, so it is divisible by 2.
What are the factors of 63428?
1, 2, 4, 101, 157, 202, 314, 404, 628, 15857, 31714, 63428.
What is 63428 in binary?
1111011111000100 (hexadecimal F7C4, octal 173704).
What is the square root of 63428?
About 251.8492, exactly 2√15857.
Is 63428 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 63428?
63428 is a happy number: repeatedly adding the squares of its digits reaches 1.