The number 81601
81601 is a composite number with 4 divisors. Its prime factorisation is 13 × 6277. Divisors (4): 1, 13, 6277, 81601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81601: a semiprime: 13 × 6277, the product of two primes.
- 2
81601 is composite. Its prime factorisation is
- 3
The divisors add up to 87892; without 81601 itself that is 6291, so 81601 is deficient (6291 is less than 81601). Euler's totient φ(81601) = 75312 numbers up to 81601 share no factor with it.
- 4
The digits of 81601 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 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81601 = 13 \times 6277 \]
81601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87892 |
| Euler totient φ(n) | 75312 |
| Square | 6658723201 |
| Cube | 543358471924801 |
| Square root | 285.658887 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.1601 × |
81601 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand six hundred and one |
| Binary (base 2) | 10011111011000001 |
| Octal (base 8) | 237301 |
| Hexadecimal (base 16) | 13EC1 |
| Base 3 | 11010221021 |
| As time | 81601 seconds = 22 h 40 min 1 s |
Is 81601 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 2) | 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 3) | 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 81601 a prime number?
No. 81601 = 13 × 6277, so it is divisible by 13.
What are the factors of 81601?
1, 13, 6277, 81601.
What is 81601 in binary?
10011111011000001 (hexadecimal 13EC1, octal 237301).
What is the square root of 81601?
About 285.6589.
Is 81601 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 81601?
81601 is a semiprime: 13 × 6277, the product of two primes.