The number 66391
66391 is a composite number with 4 divisors. Its prime factorisation is 13 × 5107. Divisors (4): 1, 13, 5107, 66391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 66391: a semiprime: 13 × 5107, the product of two primes.
- 2
66391 is composite. Its prime factorisation is
- 3
The divisors add up to 71512; without 66391 itself that is 5121, so 66391 is deficient (5121 is less than 66391). Euler's totient φ(66391) = 61272 numbers up to 66391 share no factor with it.
- 4
The digits of 66391 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 66391 = 13 \times 5107 \]
66391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71512 |
| Euler totient φ(n) | 61272 |
| Square | 4407764881 |
| Cube | 292635918214471 |
| Square root | 257.664511 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.6391 × |
66391 in other forms
| Form | Value |
|---|---|
| In words | sixty-six thousand three hundred and ninety-one |
| Binary (base 2) | 10000001101010111 |
| Octal (base 8) | 201527 |
| Hexadecimal (base 16) | 10357 |
| Base 3 | 10101001221 |
| As time | 66391 seconds = 18 h 26 min 31 s |
Is 66391 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 | No (remainder 1) | 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 1) | 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 | No (remainder 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 66391 a prime number?
No. 66391 = 13 × 5107, so it is divisible by 13.
What are the factors of 66391?
1, 13, 5107, 66391.
What is 66391 in binary?
10000001101010111 (hexadecimal 10357, octal 201527).
What is the square root of 66391?
About 257.6645.
Is 66391 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 66391?
66391 is a semiprime: 13 × 5107, the product of two primes.