The number 34691
34691 is a composite number with 4 divisors. Its prime factorisation is 113 × 307. Divisors (4): 1, 113, 307, 34691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 34691: a semiprime: 113 × 307, the product of two primes.
- 2
34691 is composite. Its prime factorisation is
- 3
The divisors add up to 35112; without 34691 itself that is 421, so 34691 is deficient (421 is less than 34691). Euler's totient φ(34691) = 34272 numbers up to 34691 share no factor with it.
- 4
The digits of 34691 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 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 34691 = 113 \times 307 \]
34691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 35112 |
| Euler totient φ(n) | 34272 |
| Square | 1203465481 |
| Cube | 41749421001371 |
| Square root | 186.255201 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 142 |
| Scientific notation | 3.4691 × |
34691 in other forms
| Form | Value |
|---|---|
| In words | thirty-four thousand six hundred and ninety-one |
| Binary (base 2) | 1000011110000011 |
| Octal (base 8) | 103603 |
| Hexadecimal (base 16) | 8783 |
| Base 3 | 1202120212 |
| As time | 34691 seconds = 9 h 38 min 11 s |
Is 34691 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 3) | 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 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 34691 a prime number?
No. 34691 = 113 × 307, so it is divisible by 113.
What are the factors of 34691?
1, 113, 307, 34691.
What is 34691 in binary?
1000011110000011 (hexadecimal 8783, octal 103603).
What is the square root of 34691?
About 186.2552.
Is 34691 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 34691?
34691 is a semiprime: 113 × 307, the product of two primes.