The number 50408
50408 is a composite number with 8 divisors. Its prime factorisation is × 6301. Divisors (8): 1, 2, 4, 8, 6301, 12602, 25204, 50408.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50408 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50408 is composite. Its prime factorisation is
- 3
The divisors add up to 94530; without 50408 itself that is 44122, so 50408 is deficient (44122 is less than 50408). Euler's totient φ(50408) = 25200 numbers up to 50408 share no factor with it.
- 4
The digits of 50408 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50408 = 2^{3} \times 6301 \]50408 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94530 |
| Euler totient φ(n) | 25200 |
| Square | 2540966464 |
| Cube | 128085037517312 |
| Square root | 224.517260 (= 2√12602) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0408 × |
50408 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and eight |
| Binary (base 2) | 1100010011101000 |
| Octal (base 8) | 142350 |
| Hexadecimal (base 16) | C4E8 |
| Base 3 | 2120010222 |
| As time | 50408 seconds = 14 h 0 min 8 s |
Is 50408 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50408 ÷ 2 = 25204) | 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 (50408 ÷ 4 = 12602) | 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 | Yes (50408 ÷ 8 = 6301) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | 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 50408 a prime number?
No. 50408 = × 6301, so it is divisible by 2.
What are the factors of 50408?
1, 2, 4, 8, 6301, 12602, 25204, 50408.
What is 50408 in binary?
1100010011101000 (hexadecimal C4E8, octal 142350).
What is the square root of 50408?
About 224.5173, exactly 2√12602.
Is 50408 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50408?
It is a composite number with 8 divisors.