The number 16953
16953 is a composite number with 4 divisors. Its prime factorisation is 3 × 5651. Divisors (4): 1, 3, 5651, 16953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16953: a semiprime: 3 × 5651, the product of two primes.
- 2
16953 is composite. Its prime factorisation is
- 3
The divisors add up to 22608; without 16953 itself that is 5655, so 16953 is deficient (5655 is less than 16953). Euler's totient φ(16953) = 11300 numbers up to 16953 share no factor with it.
- 4
The digits of 16953 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16953 = 3 \times 5651 \]
16953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22608 |
| Euler totient φ(n) | 11300 |
| Square | 287404209 |
| Cube | 4872363555177 |
| Square root | 130.203687 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.6953 × |
16953 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-three |
| Binary (base 2) | 100001000111001 |
| Octal (base 8) | 41071 |
| Hexadecimal (base 16) | 4239 |
| Base 3 | 212020220 |
| As time | 16953 seconds = 4 h 42 min 33 s |
Is 16953 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 | Yes (16953 ÷ 3 = 5651) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16953 a prime number?
No. 16953 = 3 × 5651, so it is divisible by 3.
What are the factors of 16953?
1, 3, 5651, 16953.
What is 16953 in binary?
100001000111001 (hexadecimal 4239, octal 41071).
What is the square root of 16953?
About 130.2037.
Is 16953 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 16953?
16953 is a semiprime: 3 × 5651, the product of two primes.