The number 16149
16149 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 769. Divisors (8): 1, 3, 7, 21, 769, 2307, 5383, 16149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16149: a Harshad number: divisible by its digit sum 21.
- 2
16149 is composite. Its prime factorisation is
- 3
The divisors add up to 24640; without 16149 itself that is 8491, so 16149 is deficient (8491 is less than 16149). Euler's totient φ(16149) = 9216 numbers up to 16149 share no factor with it.
- 4
The digits of 16149 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16149 = 3 \times 7 \times 769 \]
16149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24640 |
| Euler totient φ(n) | 9216 |
| Square | 260790201 |
| Cube | 4211500955949 |
| Square root | 127.078716 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.6149 × |
16149 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and forty-nine |
| Binary (base 2) | 11111100010101 |
| Octal (base 8) | 37425 |
| Hexadecimal (base 16) | 3F15 |
| Base 3 | 211011010 |
| As time | 16149 seconds = 4 h 29 min 9 s |
Is 16149 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 (16149 ÷ 3 = 5383) | 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 | Yes (16149 ÷ 7 = 2307) | 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 3) | 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 | No (remainder 1) | 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 16149 a prime number?
No. 16149 = 3 × 7 × 769, so it is divisible by 3.
What are the factors of 16149?
1, 3, 7, 21, 769, 2307, 5383, 16149.
What is 16149 in binary?
11111100010101 (hexadecimal 3F15, octal 37425).
What is the square root of 16149?
About 127.0787.
Is 16149 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16149?
16149 is a Harshad number: divisible by its digit sum 21.