The number 16153
16153 is a composite number with 4 divisors. Its prime factorisation is 29 × 557. Divisors (4): 1, 29, 557, 16153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16153: a semiprime: 29 × 557, the product of two primes.
- 2
16153 is composite. Its prime factorisation is
- 3
The divisors add up to 16740; without 16153 itself that is 587, so 16153 is deficient (587 is less than 16153). Euler's totient φ(16153) = 15568 numbers up to 16153 share no factor with it.
- 4
The digits of 16153 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16153 = 29 \times 557 \]
16153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16740 |
| Euler totient φ(n) | 15568 |
| Square | 260919409 |
| Cube | 4214631213577 |
| Square root | 127.094453 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 190 |
| Scientific notation | 1.6153 × |
16153 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and fifty-three |
| Binary (base 2) | 11111100011001 |
| Octal (base 8) | 37431 |
| Hexadecimal (base 16) | 3F19 |
| Base 3 | 211011021 |
| As time | 16153 seconds = 4 h 29 min 13 s |
Is 16153 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 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | 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 16153 a prime number?
No. 16153 = 29 × 557, so it is divisible by 29.
What are the factors of 16153?
1, 29, 557, 16153.
What is 16153 in binary?
11111100011001 (hexadecimal 3F19, octal 37431).
What is the square root of 16153?
About 127.0945.
Is 16153 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 16153?
16153 is a semiprime: 29 × 557, the product of two primes.