The number 34951
34951 is a composite number with 4 divisors. Its prime factorisation is 7 × 4993. Divisors (4): 1, 7, 4993, 34951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 34951: a semiprime: 7 × 4993, the product of two primes.
- 2
34951 is composite. Its prime factorisation is
- 3
The divisors add up to 39952; without 34951 itself that is 5001, so 34951 is deficient (5001 is less than 34951). Euler's totient φ(34951) = 29952 numbers up to 34951 share no factor with it.
- 4
The digits of 34951 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 34951 = 7 \times 4993 \]
34951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 39952 |
| Euler totient φ(n) | 29952 |
| Square | 1221572401 |
| Cube | 42695176987351 |
| Square root | 186.951865 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 54 |
| Scientific notation | 3.4951 × |
34951 in other forms
| Form | Value |
|---|---|
| In words | thirty-four thousand nine hundred and fifty-one |
| Binary (base 2) | 1000100010000111 |
| Octal (base 8) | 104207 |
| Hexadecimal (base 16) | 8887 |
| Base 3 | 1202221111 |
| As time | 34951 seconds = 9 h 42 min 31 s |
Is 34951 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (34951 ÷ 7 = 4993) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 34951 a prime number?
No. 34951 = 7 × 4993, so it is divisible by 7.
What are the factors of 34951?
1, 7, 4993, 34951.
What is 34951 in binary?
1000100010000111 (hexadecimal 8887, octal 104207).
What is the square root of 34951?
About 186.9519.
Is 34951 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 34951?
34951 is a semiprime: 7 × 4993, the product of two primes.