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