The number 36050
36050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 103. Divisors (24): 1, 2, 5, 7, 10, 14, 25, 35, 50, 70, 103, 175, 206, 350, 515, 721 … 36050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36050: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
36050 is composite. Its prime factorisation is
- 3
The divisors add up to 77376; without 36050 itself that is 41326, so 36050 is abundant (41326 is more than 36050). Euler's totient φ(36050) = 12240 numbers up to 36050 share no factor with it.
- 4
The digits of 36050 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36050 = 2 \times 5^{2} \times 7 \times 103 \]36050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 77376 |
| Euler totient φ(n) | 12240 |
| Square | 1299602500 |
| Cube | 46850670125000 |
| Square root | 189.868375 (= 5√1442) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.605 × |
36050 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand and fifty |
| Binary (base 2) | 1000110011010010 |
| Octal (base 8) | 106322 |
| Hexadecimal (base 16) | 8CD2 |
| Base 3 | 1211110012 |
| As time | 36050 seconds = 10 h 0 min 50 s |
Is 36050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36050 ÷ 2 = 18025) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (36050 ÷ 5 = 7210) | 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 | Yes (36050 ÷ 7 = 5150) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (36050 ÷ 10 = 3605) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36050 a prime number?
No. 36050 = 2 × × 7 × 103, so it is divisible by 2.
What are the factors of 36050?
1, 2, 5, 7, 10, 14, 25, 35, 50, 70, 103, 175, 206, 350, 515, 721, 1030, 1442, 2575, 3605, 5150, 7210, 18025, 36050.
What is 36050 in binary?
1000110011010010 (hexadecimal 8CD2, octal 106322).
What is the square root of 36050?
About 189.8684, exactly 5√1442.
Is 36050 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 36050?
36050 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.