The number 50447
50447 is a composite number with 4 divisors. Its prime factorisation is 61 × 827. Divisors (4): 1, 61, 827, 50447.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50447: a semiprime: 61 × 827, the product of two primes.
- 2
50447 is composite. Its prime factorisation is
- 3
The divisors add up to 51336; without 50447 itself that is 889, so 50447 is deficient (889 is less than 50447). Euler's totient φ(50447) = 49560 numbers up to 50447 share no factor with it.
- 4
The digits of 50447 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50447 = 61 \times 827 \]
50447 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51336 |
| Euler totient φ(n) | 49560 |
| Square | 2544899809 |
| Cube | 128382560664623 |
| Square root | 224.604096 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0447 × |
50447 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and forty-seven |
| Binary (base 2) | 1100010100001111 |
| Octal (base 8) | 142417 |
| Hexadecimal (base 16) | C50F |
| Base 3 | 2120012102 |
| As time | 50447 seconds = 14 h 0 min 47 s |
Is 50447 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 2) | 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 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50447 a prime number?
No. 50447 = 61 × 827, so it is divisible by 61.
What are the factors of 50447?
1, 61, 827, 50447.
What is 50447 in binary?
1100010100001111 (hexadecimal C50F, octal 142417).
What is the square root of 50447?
About 224.6041.
Is 50447 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50447?
50447 is a semiprime: 61 × 827, the product of two primes.