The number 30701
30701 is a composite number with 4 divisors. Its prime factorisation is 11 × 2791. Divisors (4): 1, 11, 2791, 30701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30701: a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 2791, the product of two primes.
- 2
30701 is composite. Its prime factorisation is
- 3
The divisors add up to 33504; without 30701 itself that is 2803, so 30701 is deficient (2803 is less than 30701). Euler's totient φ(30701) = 27900 numbers up to 30701 share no factor with it.
- 4
The digits of 30701 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30701 = 11 \times 2791 \]
30701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33504 |
| Euler totient φ(n) | 27900 |
| Square | 942551401 |
| Cube | 28937270562101 |
| Square root | 175.217008 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 178 |
| Scientific notation | 3.0701 × |
30701 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand seven hundred and one |
| Binary (base 2) | 111011111101101 |
| Octal (base 8) | 73755 |
| Hexadecimal (base 16) | 77ED |
| Base 3 | 1120010002 |
| As time | 30701 seconds = 8 h 31 min 41 s |
Is 30701 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 6) | 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 2) | 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 (30701 ÷ 11 = 2791) | 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 30701 a prime number?
No. 30701 = 11 × 2791, so it is divisible by 11.
What are the factors of 30701?
1, 11, 2791, 30701.
What is 30701 in binary?
111011111101101 (hexadecimal 77ED, octal 73755).
What is the square root of 30701?
About 175.2170.
Is 30701 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 30701?
30701 is a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 2791, the product of two primes.