The number 16958
16958 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 139. Divisors (8): 1, 2, 61, 122, 139, 278, 8479, 16958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16958 is composite. Its prime factorisation is
- 3
The divisors add up to 26040; without 16958 itself that is 9082, so 16958 is deficient (9082 is less than 16958). Euler's totient φ(16958) = 8280 numbers up to 16958 share no factor with it.
- 4
The digits of 16958 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16958 = 2 \times 61 \times 139 \]
16958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26040 |
| Euler totient φ(n) | 8280 |
| Square | 287573764 |
| Cube | 4876675889912 |
| Square root | 130.222886 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6958 × |
16958 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-eight |
| Binary (base 2) | 100001000111110 |
| Octal (base 8) | 41076 |
| Hexadecimal (base 16) | 423E |
| Base 3 | 212021002 |
| As time | 16958 seconds = 4 h 42 min 38 s |
Is 16958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16958 ÷ 2 = 8479) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16958 a prime number?
No. 16958 = 2 × 61 × 139, so it is divisible by 2.
What are the factors of 16958?
1, 2, 61, 122, 139, 278, 8479, 16958.
What is 16958 in binary?
100001000111110 (hexadecimal 423E, octal 41076).
What is the square root of 16958?
About 130.2229.
Is 16958 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 16958?
It is a composite number with 8 divisors.