The number 69161
69161 is a composite number with 8 divisors. Its prime factorisation is 23 × 31 × 97. Divisors (8): 1, 23, 31, 97, 713, 2231, 3007, 69161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69161: a Harshad number: divisible by its digit sum 23.
- 2
69161 is composite. Its prime factorisation is
- 3
The divisors add up to 75264; without 69161 itself that is 6103, so 69161 is deficient (6103 is less than 69161). Euler's totient φ(69161) = 63360 numbers up to 69161 share no factor with it.
- 4
The digits of 69161 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69161 = 23 \times 31 \times 97 \]
69161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75264 |
| Euler totient φ(n) | 63360 |
| Square | 4783243921 |
| Cube | 330813932820281 |
| Square root | 262.984790 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.9161 × |
69161 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and sixty-one |
| Binary (base 2) | 10000111000101001 |
| Octal (base 8) | 207051 |
| Hexadecimal (base 16) | 10E29 |
| Base 3 | 10111212112 |
| As time | 69161 seconds = 19 h 12 min 41 s |
Is 69161 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 1) | 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 5) | 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 4) | 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 69161 a prime number?
No. 69161 = 23 × 31 × 97, so it is divisible by 23.
What are the factors of 69161?
1, 23, 31, 97, 713, 2231, 3007, 69161.
What is 69161 in binary?
10000111000101001 (hexadecimal 10E29, octal 207051).
What is the square root of 69161?
About 262.9848.
Is 69161 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 69161?
69161 is a Harshad number: divisible by its digit sum 23.