The number 64141
64141 is a composite number with 16 divisors. Its prime factorisation is × 11 × 17. Divisors (16): 1, 7, 11, 17, 49, 77, 119, 187, 343, 539, 833, 1309, 3773, 5831, 9163, 64141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64141: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
64141 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 64141 itself that is 22259, so 64141 is deficient (22259 is less than 64141). Euler's totient φ(64141) = 47040 numbers up to 64141 share no factor with it.
- 4
The digits of 64141 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64141 = 7^{3} \times 11 \times 17 \]64141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 47040 |
| Square | 4114067881 |
| Cube | 263880427955221 |
| Square root | 253.260735 (= 7√1309) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.4141 × |
64141 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand one hundred and forty-one |
| Binary (base 2) | 1111101010001101 |
| Octal (base 8) | 175215 |
| Hexadecimal (base 16) | FA8D |
| Base 3 | 10020222121 |
| As time | 64141 seconds = 17 h 49 min 1 s |
Is 64141 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (64141 ÷ 7 = 9163) | 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 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 | Yes (64141 ÷ 11 = 5831) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64141 a prime number?
No. 64141 = × 11 × 17, so it is divisible by 7.
What are the factors of 64141?
1, 7, 11, 17, 49, 77, 119, 187, 343, 539, 833, 1309, 3773, 5831, 9163, 64141.
What is 64141 in binary?
1111101010001101 (hexadecimal FA8D, octal 175215).
What is the square root of 64141?
About 253.2607, exactly 7√1309.
Is 64141 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 64141?
64141 is a happy number: repeatedly adding the squares of its digits reaches 1.