The number 69641
69641 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 487. Divisors (8): 1, 11, 13, 143, 487, 5357, 6331, 69641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69641 is composite. Its prime factorisation is
- 3
The divisors add up to 81984; without 69641 itself that is 12343, so 69641 is deficient (12343 is less than 69641). Euler's totient φ(69641) = 58320 numbers up to 69641 share no factor with it.
- 4
The digits of 69641 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69641 = 11 \times 13 \times 487 \]
69641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81984 |
| Euler totient φ(n) | 58320 |
| Square | 4849868881 |
| Cube | 337749718741721 |
| Square root | 263.895813 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9641 × |
69641 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand six hundred and forty-one |
| Binary (base 2) | 10001000000001001 |
| Octal (base 8) | 210011 |
| Hexadecimal (base 16) | 11009 |
| Base 3 | 10112112022 |
| As time | 69641 seconds = 19 h 20 min 41 s |
Is 69641 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 1) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (69641 ÷ 11 = 6331) | 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 69641 a prime number?
No. 69641 = 11 × 13 × 487, so it is divisible by 11.
What are the factors of 69641?
1, 11, 13, 143, 487, 5357, 6331, 69641.
What is 69641 in binary?
10001000000001001 (hexadecimal 11009, octal 210011).
What is the square root of 69641?
About 263.8958.
Is 69641 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 69641?
It is a composite number with 8 divisors.