The number 50603
50603 is a composite number with 4 divisors. Its prime factorisation is 7 × 7229. Divisors (4): 1, 7, 7229, 50603.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50603: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 7229, the product of two primes.
- 2
50603 is composite. Its prime factorisation is
- 3
The divisors add up to 57840; without 50603 itself that is 7237, so 50603 is deficient (7237 is less than 50603). Euler's totient φ(50603) = 43368 numbers up to 50603 share no factor with it.
- 4
The digits of 50603 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50603 = 7 \times 7229 \]
50603 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57840 |
| Euler totient φ(n) | 43368 |
| Square | 2560663609 |
| Cube | 129577260606227 |
| Square root | 224.951106 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0603 × |
50603 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and three |
| Binary (base 2) | 1100010110101011 |
| Octal (base 8) | 142653 |
| Hexadecimal (base 16) | C5AB |
| Base 3 | 2120102012 |
| As time | 50603 seconds = 14 h 3 min 23 s |
Is 50603 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50603 ÷ 7 = 7229) | 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 3) | 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 3) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50603 a prime number?
No. 50603 = 7 × 7229, so it is divisible by 7.
What are the factors of 50603?
1, 7, 7229, 50603.
What is 50603 in binary?
1100010110101011 (hexadecimal C5AB, octal 142653).
What is the square root of 50603?
About 224.9511.
Is 50603 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50603?
50603 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 7229, the product of two primes.