The number 43050
43050 is a composite number with 48 divisors. Its prime factorisation is 2 × 3 × × 7 × 41. Divisors (48): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 41, 42, 50 … 43050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
43050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
43050 is composite. Its prime factorisation is
- 3
The divisors add up to 124992; without 43050 itself that is 81942, so 43050 is abundant (81942 is more than 43050). Euler's totient φ(43050) = 9600 numbers up to 43050 share no factor with it.
- 4
The digits of 43050 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 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 43050 = 2 \times 3 \times 5^{2} \times 7 \times 41 \]43050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 124992 |
| Euler totient φ(n) | 9600 |
| Square | 1853302500 |
| Cube | 79784672625000 |
| Square root | 207.484939 (= 5√1722) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 119 |
| Scientific notation | 4.305 × |
43050 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand and fifty |
| Binary (base 2) | 1010100000101010 |
| Octal (base 8) | 124052 |
| Hexadecimal (base 16) | A82A |
| Base 3 | 2012001110 |
| As time | 43050 seconds = 11 h 57 min 30 s |
Is 43050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (43050 ÷ 2 = 21525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (43050 ÷ 3 = 14350) | 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 (43050 ÷ 5 = 8610) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (43050 ÷ 6 = 7175) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (43050 ÷ 7 = 6150) | 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 2) | 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 | Yes (43050 ÷ 10 = 4305) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 43050 a prime number?
No. 43050 = 2 × 3 × × 7 × 41, so it is divisible by 2.
What are the factors of 43050?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 41, 42, 50, 70, 75, 82, 105, 123, 150, 175, 205, 210, 246, 287, 350, 410, 525, 574, 615, 861, 1025, 1050, 1230, 1435, 1722, 2050, 2870, 3075, 4305, 6150, 7175, 8610, 14350, 21525, 43050.
What is 43050 in binary?
1010100000101010 (hexadecimal A82A, octal 124052).
What is the square root of 43050?
About 207.4849, exactly 5√1722.
Is 43050 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 43050?
It is a composite number with 48 divisors.