The number 50403
50403 is a triangular number: 1 + 2 + … + 317 = 50403. Its prime factorisation is 3 × 53 × 317. Divisors (8): 1, 3, 53, 159, 317, 951, 16801, 50403.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50403: a triangular number: 1 + 2 + … + 317 = 50403.
- 2
50403 is composite. Its prime factorisation is
- 3
The divisors add up to 68688; without 50403 itself that is 18285, so 50403 is deficient (18285 is less than 50403). Euler's totient φ(50403) = 32864 numbers up to 50403 share no factor with it.
- 4
The digits of 50403 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50403 = 3 \times 53 \times 317 \]
50403 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68688 |
| Euler totient φ(n) | 32864 |
| Square | 2540462409 |
| Cube | 128046926800827 |
| Square root | 224.506125 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0403 × |
50403 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and three |
| Binary (base 2) | 1100010011100011 |
| Octal (base 8) | 142343 |
| Hexadecimal (base 16) | C4E3 |
| Base 3 | 2120010210 |
| As time | 50403 seconds = 14 h 0 min 3 s |
Is 50403 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 | Yes (50403 ÷ 3 = 16801) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50403 a prime number?
No. 50403 = 3 × 53 × 317, so it is divisible by 3.
What are the factors of 50403?
1, 3, 53, 159, 317, 951, 16801, 50403.
What is 50403 in binary?
1100010011100011 (hexadecimal C4E3, octal 142343).
What is the square root of 50403?
About 224.5061.
Is 50403 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50403?
50403 is a triangular number: 1 + 2 + … + 317 = 50403.