The number 64181
64181 is a composite number with 4 divisors. Its prime factorisation is 13 × 4937. Divisors (4): 1, 13, 4937, 64181.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64181: a semiprime: 13 × 4937, the product of two primes.
- 2
64181 is composite. Its prime factorisation is
- 3
The divisors add up to 69132; without 64181 itself that is 4951, so 64181 is deficient (4951 is less than 64181). Euler's totient φ(64181) = 59232 numbers up to 64181 share no factor with it.
- 4
The digits of 64181 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 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64181 = 13 \times 4937 \]
64181 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69132 |
| Euler totient φ(n) | 59232 |
| Square | 4119200761 |
| Cube | 264374424041741 |
| Square root | 253.339693 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 192 |
| Scientific notation | 6.4181 × |
64181 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand one hundred and eighty-one |
| Binary (base 2) | 1111101010110101 |
| Octal (base 8) | 175265 |
| Hexadecimal (base 16) | FAB5 |
| Base 3 | 10021001002 |
| As time | 64181 seconds = 17 h 49 min 41 s |
Is 64181 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64181 a prime number?
No. 64181 = 13 × 4937, so it is divisible by 13.
What are the factors of 64181?
1, 13, 4937, 64181.
What is 64181 in binary?
1111101010110101 (hexadecimal FAB5, octal 175265).
What is the square root of 64181?
About 253.3397.
Is 64181 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 64181?
64181 is a semiprime: 13 × 4937, the product of two primes.