The number 66950
66950 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 103. Divisors (24): 1, 2, 5, 10, 13, 25, 26, 50, 65, 103, 130, 206, 325, 515, 650, 1030 … 66950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 66950: a Harshad number: divisible by its digit sum 26.
- 2
66950 is composite. Its prime factorisation is
- 3
The divisors add up to 135408; without 66950 itself that is 68458, so 66950 is abundant (68458 is more than 66950). Euler's totient φ(66950) = 24480 numbers up to 66950 share no factor with it.
- 4
The digits of 66950 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 66950 = 2 \times 5^{2} \times 13 \times 103 \]66950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 135408 |
| Euler totient φ(n) | 24480 |
| Square | 4482302500 |
| Cube | 300090152375000 |
| Square root | 258.746981 (= 5√2678) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.695 × |
66950 in other forms
| Form | Value |
|---|---|
| In words | sixty-six thousand nine hundred and fifty |
| Binary (base 2) | 10000010110000110 |
| Octal (base 8) | 202606 |
| Hexadecimal (base 16) | 10586 |
| Base 3 | 10101211122 |
| As time | 66950 seconds = 18 h 35 min 50 s |
Is 66950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (66950 ÷ 2 = 33475) | 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 (66950 ÷ 5 = 13390) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (66950 ÷ 10 = 6695) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 66950 a prime number?
No. 66950 = 2 × × 13 × 103, so it is divisible by 2.
What are the factors of 66950?
1, 2, 5, 10, 13, 25, 26, 50, 65, 103, 130, 206, 325, 515, 650, 1030, 1339, 2575, 2678, 5150, 6695, 13390, 33475, 66950.
What is 66950 in binary?
10000010110000110 (hexadecimal 10586, octal 202606).
What is the square root of 66950?
About 258.7470, exactly 5√2678.
Is 66950 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 66950?
66950 is a Harshad number: divisible by its digit sum 26.