The number 16957
16957 is a composite number with 4 divisors. Its prime factorisation is 31 × 547. Divisors (4): 1, 31, 547, 16957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16957: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 547, the product of two primes.
- 2
16957 is composite. Its prime factorisation is
- 3
The divisors add up to 17536; without 16957 itself that is 579, so 16957 is deficient (579 is less than 16957). Euler's totient φ(16957) = 16380 numbers up to 16957 share no factor with it.
- 4
The digits of 16957 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16957 = 31 \times 547 \]
16957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17536 |
| Euler totient φ(n) | 16380 |
| Square | 287539849 |
| Cube | 4875813219493 |
| Square root | 130.219046 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6957 × |
16957 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-seven |
| Binary (base 2) | 100001000111101 |
| Octal (base 8) | 41075 |
| Hexadecimal (base 16) | 423D |
| Base 3 | 212021001 |
| As time | 16957 seconds = 4 h 42 min 37 s |
Is 16957 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 2) | 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 3) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 16957 a prime number?
No. 16957 = 31 × 547, so it is divisible by 31.
What are the factors of 16957?
1, 31, 547, 16957.
What is 16957 in binary?
100001000111101 (hexadecimal 423D, octal 41075).
What is the square root of 16957?
About 130.2190.
Is 16957 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 16957?
16957 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 547, the product of two primes.