The number 50630
50630 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 61 × 83. Divisors (16): 1, 2, 5, 10, 61, 83, 122, 166, 305, 415, 610, 830, 5063, 10126, 25315, 50630.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50630: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50630 is composite. Its prime factorisation is
- 3
The divisors add up to 93744; without 50630 itself that is 43114, so 50630 is deficient (43114 is less than 50630). Euler's totient φ(50630) = 19680 numbers up to 50630 share no factor with it.
- 4
The digits of 50630 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50630 = 2 \times 5 \times 61 \times 83 \]
50630 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93744 |
| Euler totient φ(n) | 19680 |
| Square | 2563396900 |
| Cube | 129784785047000 |
| Square root | 225.011111 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.063 × |
50630 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and thirty |
| Binary (base 2) | 1100010111000110 |
| Octal (base 8) | 142706 |
| Hexadecimal (base 16) | C5C6 |
| Base 3 | 2120110012 |
| As time | 50630 seconds = 14 h 3 min 50 s |
Is 50630 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50630 ÷ 2 = 25315) | 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 (50630 ÷ 5 = 10126) | 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 6) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50630 ÷ 10 = 5063) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 50630 a prime number?
No. 50630 = 2 × 5 × 61 × 83, so it is divisible by 2.
What are the factors of 50630?
1, 2, 5, 10, 61, 83, 122, 166, 305, 415, 610, 830, 5063, 10126, 25315, 50630.
What is 50630 in binary?
1100010111000110 (hexadecimal C5C6, octal 142706).
What is the square root of 50630?
About 225.0111.
Is 50630 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50630?
50630 is a happy number: repeatedly adding the squares of its digits reaches 1.