The number 69050
69050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1381. Divisors (12): 1, 2, 5, 10, 25, 50, 1381, 2762, 6905, 13810, 34525, 69050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69050 is composite. Its prime factorisation is
- 3
The divisors add up to 128526; without 69050 itself that is 59476, so 69050 is deficient (59476 is less than 69050). Euler's totient φ(69050) = 27600 numbers up to 69050 share no factor with it.
- 4
The digits of 69050 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69050 = 2 \times 5^{2} \times 1381 \]69050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 128526 |
| Euler totient φ(n) | 27600 |
| Square | 4767902500 |
| Cube | 329223667625000 |
| Square root | 262.773667 (= 5√2762) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.905 × |
69050 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand and fifty |
| Binary (base 2) | 10000110110111010 |
| Octal (base 8) | 206672 |
| Hexadecimal (base 16) | 10DBA |
| Base 3 | 10111201102 |
| As time | 69050 seconds = 19 h 10 min 50 s |
Is 69050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69050 ÷ 2 = 34525) | 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 (69050 ÷ 5 = 13810) | 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 | No (remainder 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69050 ÷ 10 = 6905) | 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 69050 a prime number?
No. 69050 = 2 × × 1381, so it is divisible by 2.
What are the factors of 69050?
1, 2, 5, 10, 25, 50, 1381, 2762, 6905, 13810, 34525, 69050.
What is 69050 in binary?
10000110110111010 (hexadecimal 10DBA, octal 206672).
What is the square root of 69050?
About 262.7737, exactly 5√2762.
Is 69050 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 69050?
It is a composite number with 12 divisors.