The number 66951
66951 is a composite number with 12 divisors. Its prime factorisation is × 43 × 173. Divisors (12): 1, 3, 9, 43, 129, 173, 387, 519, 1557, 7439, 22317, 66951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
66951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
66951 is composite. Its prime factorisation is
- 3
The divisors add up to 99528; without 66951 itself that is 32577, so 66951 is deficient (32577 is less than 66951). Euler's totient φ(66951) = 43344 numbers up to 66951 share no factor with it.
- 4
The digits of 66951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 66951 = 3^{2} \times 43 \times 173 \]66951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 99528 |
| Euler totient φ(n) | 43344 |
| Square | 4482436401 |
| Cube | 300103599483351 |
| Square root | 258.748913 (= 3√7439) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 6.6951 × |
66951 in other forms
| Form | Value |
|---|---|
| In words | sixty-six thousand nine hundred and fifty-one |
| Binary (base 2) | 10000010110000111 |
| Octal (base 8) | 202607 |
| Hexadecimal (base 16) | 10587 |
| Base 3 | 10101211200 |
| As time | 66951 seconds = 18 h 35 min 51 s |
Is 66951 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (66951 ÷ 3 = 22317) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (66951 ÷ 9 = 7439) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 66951 a prime number?
No. 66951 = × 43 × 173, so it is divisible by 3.
What are the factors of 66951?
1, 3, 9, 43, 129, 173, 387, 519, 1557, 7439, 22317, 66951.
What is 66951 in binary?
10000010110000111 (hexadecimal 10587, octal 202607).
What is the square root of 66951?
About 258.7489, exactly 3√7439.
Is 66951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 66951?
It is a composite number with 12 divisors.