The number 63050
63050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 97. Divisors (24): 1, 2, 5, 10, 13, 25, 26, 50, 65, 97, 130, 194, 325, 485, 650, 970 … 63050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63050: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
63050 is composite. Its prime factorisation is
- 3
The divisors add up to 127596; without 63050 itself that is 64546, so 63050 is abundant (64546 is more than 63050). Euler's totient φ(63050) = 23040 numbers up to 63050 share no factor with it.
- 4
The digits of 63050 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63050 = 2 \times 5^{2} \times 13 \times 97 \]63050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 127596 |
| Euler totient φ(n) | 23040 |
| Square | 3975302500 |
| Cube | 250642822625000 |
| Square root | 251.097591 (= 5√2522) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.305 × |
63050 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand and fifty |
| Binary (base 2) | 1111011001001010 |
| Octal (base 8) | 173112 |
| Hexadecimal (base 16) | F64A |
| Base 3 | 10012111012 |
| As time | 63050 seconds = 17 h 30 min 50 s |
Is 63050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63050 ÷ 2 = 31525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (63050 ÷ 5 = 12610) | 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 2) | 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 | Yes (63050 ÷ 10 = 6305) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 63050 a prime number?
No. 63050 = 2 × × 13 × 97, so it is divisible by 2.
What are the factors of 63050?
1, 2, 5, 10, 13, 25, 26, 50, 65, 97, 130, 194, 325, 485, 650, 970, 1261, 2425, 2522, 4850, 6305, 12610, 31525, 63050.
What is 63050 in binary?
1111011001001010 (hexadecimal F64A, octal 173112).
What is the square root of 63050?
About 251.0976, exactly 5√2522.
Is 63050 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 63050?
63050 is a happy number: repeatedly adding the squares of its digits reaches 1.