The number 16929
16929 is a binary palindrome (100001000100001). Its prime factorisation is × 11 × 19. Divisors (20): 1, 3, 9, 11, 19, 27, 33, 57, 81, 99, 171, 209, 297, 513, 627, 891 … 16929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16929: a binary palindrome (100001000100001); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
16929 is composite. Its prime factorisation is
- 3
The divisors add up to 29040; without 16929 itself that is 12111, so 16929 is deficient (12111 is less than 16929). Euler's totient φ(16929) = 9720 numbers up to 16929 share no factor with it.
- 4
The digits of 16929 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16929 = 3^{4} \times 11 \times 19 \]16929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 29040 |
| Euler totient φ(n) | 9720 |
| Square | 286591041 |
| Cube | 4851699733089 |
| Square root | 130.111491 (= 9√209) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6929 × |
16929 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and twenty-nine |
| Binary (base 2) | 100001000100001 |
| Octal (base 8) | 41041 |
| Hexadecimal (base 16) | 4221 |
| Base 3 | 212020000 |
| As time | 16929 seconds = 4 h 42 min 9 s |
Is 16929 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 (16929 ÷ 3 = 5643) | 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 4) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16929 ÷ 9 = 1881) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16929 ÷ 11 = 1539) | 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 16929 a prime number?
No. 16929 = × 11 × 19, so it is divisible by 3.
What are the factors of 16929?
1, 3, 9, 11, 19, 27, 33, 57, 81, 99, 171, 209, 297, 513, 627, 891, 1539, 1881, 5643, 16929.
What is 16929 in binary?
100001000100001 (hexadecimal 4221, octal 41041).
What is the square root of 16929?
About 130.1115, exactly 9√209.
Is 16929 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 16929?
16929 is a binary palindrome (100001000100001); a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.