The number 69361
69361 is a composite number with 4 divisors. Its prime factorisation is 139 × 499. Divisors (4): 1, 139, 499, 69361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69361: a semiprime: 139 × 499, the product of two primes.
- 2
69361 is composite. Its prime factorisation is
- 3
The divisors add up to 70000; without 69361 itself that is 639, so 69361 is deficient (639 is less than 69361). Euler's totient φ(69361) = 68724 numbers up to 69361 share no factor with it.
- 4
The digits of 69361 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
\[ 69361 = 139 \times 499 \]
69361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70000 |
| Euler totient φ(n) | 68724 |
| Square | 4810948321 |
| Cube | 333692186492881 |
| Square root | 263.364766 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9361 × |
69361 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and sixty-one |
| Binary (base 2) | 10000111011110001 |
| Octal (base 8) | 207361 |
| Hexadecimal (base 16) | 10EF1 |
| Base 3 | 10112010221 |
| As time | 69361 seconds = 19 h 16 min 1 s |
Is 69361 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 | 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 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69361 a prime number?
No. 69361 = 139 × 499, so it is divisible by 139.
What are the factors of 69361?
1, 139, 499, 69361.
What is 69361 in binary?
10000111011110001 (hexadecimal 10EF1, octal 207361).
What is the square root of 69361?
About 263.3648.
Is 69361 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69361?
69361 is a semiprime: 139 × 499, the product of two primes.