The number 69550
69550 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 107. Divisors (24): 1, 2, 5, 10, 13, 25, 26, 50, 65, 107, 130, 214, 325, 535, 650, 1070 … 69550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69550: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 25.
- 2
69550 is composite. Its prime factorisation is
- 3
The divisors add up to 140616; without 69550 itself that is 71066, so 69550 is abundant (71066 is more than 69550). Euler's totient φ(69550) = 25440 numbers up to 69550 share no factor with it.
- 4
The digits of 69550 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69550 = 2 \times 5^{2} \times 13 \times 107 \]69550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 140616 |
| Euler totient φ(n) | 25440 |
| Square | 4837202500 |
| Cube | 336427433875000 |
| Square root | 263.723340 (= 5√2782) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.955 × |
69550 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred and fifty |
| Binary (base 2) | 10000111110101110 |
| Octal (base 8) | 207656 |
| Hexadecimal (base 16) | 10FAE |
| Base 3 | 10112101221 |
| As time | 69550 seconds = 19 h 19 min 10 s |
Is 69550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69550 ÷ 2 = 34775) | 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 (69550 ÷ 5 = 13910) | 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 | No (remainder 5) | 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 (69550 ÷ 10 = 6955) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 69550 a prime number?
No. 69550 = 2 × × 13 × 107, so it is divisible by 2.
What are the factors of 69550?
1, 2, 5, 10, 13, 25, 26, 50, 65, 107, 130, 214, 325, 535, 650, 1070, 1391, 2675, 2782, 5350, 6955, 13910, 34775, 69550.
What is 69550 in binary?
10000111110101110 (hexadecimal 10FAE, octal 207656).
What is the square root of 69550?
About 263.7233, exactly 5√2782.
Is 69550 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69550?
69550 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 25.