The number 69500
69500 is a composite number with 24 divisors. Its prime factorisation is × × 139. Divisors (24): 1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 139, 250, 278, 500, 556, 695 … 69500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69500: a Harshad number: divisible by its digit sum 20.
- 2
69500 is composite. Its prime factorisation is
- 3
The divisors add up to 152880; without 69500 itself that is 83380, so 69500 is abundant (83380 is more than 69500). Euler's totient φ(69500) = 27600 numbers up to 69500 share no factor with it.
- 4
The digits of 69500 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69500 = 2^{2} \times 5^{3} \times 139 \]69500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 152880 |
| Euler totient φ(n) | 27600 |
| Square | 4830250000 |
| Cube | 335702375000000 |
| Square root | 263.628527 (= 10√695) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.95 × |
69500 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred |
| Binary (base 2) | 10000111101111100 |
| Octal (base 8) | 207574 |
| Hexadecimal (base 16) | 10F7C |
| Base 3 | 10112100002 |
| As time | 69500 seconds = 19 h 18 min 20 s |
Is 69500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69500 ÷ 2 = 34750) | 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 | Yes (69500 ÷ 4 = 17375) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69500 ÷ 5 = 13900) | 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 4) | 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 4) | 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 (69500 ÷ 10 = 6950) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69500 a prime number?
No. 69500 = × × 139, so it is divisible by 2.
What are the factors of 69500?
1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 139, 250, 278, 500, 556, 695, 1390, 2780, 3475, 6950, 13900, 17375, 34750, 69500.
What is 69500 in binary?
10000111101111100 (hexadecimal 10F7C, octal 207574).
What is the square root of 69500?
About 263.6285, exactly 10√695.
Is 69500 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 69500?
69500 is a Harshad number: divisible by its digit sum 20.