The number 50470
50470 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 103. Divisors (24): 1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 103, 206, 245, 490, 515, 721 … 50470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50470 is composite. Its prime factorisation is
- 3
The divisors add up to 106704; without 50470 itself that is 56234, so 50470 is abundant (56234 is more than 50470). Euler's totient φ(50470) = 17136 numbers up to 50470 share no factor with it.
- 4
The digits of 50470 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50470 = 2 \times 5 \times 7^{2} \times 103 \]50470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 106704 |
| Euler totient φ(n) | 17136 |
| Square | 2547220900 |
| Cube | 128558238823000 |
| Square root | 224.655292 (= 7√1030) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.047 × |
50470 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and seventy |
| Binary (base 2) | 1100010100100110 |
| Octal (base 8) | 142446 |
| Hexadecimal (base 16) | C526 |
| Base 3 | 2120020021 |
| As time | 50470 seconds = 14 h 1 min 10 s |
Is 50470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50470 ÷ 2 = 25235) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50470 ÷ 5 = 10094) | 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 | Yes (50470 ÷ 7 = 7210) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50470 ÷ 10 = 5047) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50470 a prime number?
No. 50470 = 2 × 5 × × 103, so it is divisible by 2.
What are the factors of 50470?
1, 2, 5, 7, 10, 14, 35, 49, 70, 98, 103, 206, 245, 490, 515, 721, 1030, 1442, 3605, 5047, 7210, 10094, 25235, 50470.
What is 50470 in binary?
1100010100100110 (hexadecimal C526, octal 142446).
What is the square root of 50470?
About 224.6553, exactly 7√1030.
Is 50470 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50470?
It is a composite number with 24 divisors.