The number 8153
8153 is a composite number with 4 divisors. Its prime factorisation is 31 × 263. Divisors (4): 1, 31, 263, 8153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8153: a semiprime: 31 × 263, the product of two primes.
- 2
8153 is composite. Its prime factorisation is
- 3
The divisors add up to 8448; without 8153 itself that is 295, so 8153 is deficient (295 is less than 8153). Euler's totient φ(8153) = 7860 numbers up to 8153 share no factor with it.
- 4
The digits of 8153 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8153 = 31 \times 263 \]
8153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8448 |
| Euler totient φ(n) | 7860 |
| Square | 66471409 |
| Cube | 541941397577 |
| Square root | 90.293964 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 114 |
| Scientific notation | 8.153 × |
8153 in other forms
| Form | Value |
|---|---|
| In words | eight thousand one hundred and fifty-three |
| Binary (base 2) | 1111111011001 |
| Octal (base 8) | 17731 |
| Hexadecimal (base 16) | 1FD9 |
| Base 3 | 102011222 |
| As time | 8153 seconds = 2 h 15 min 53 s |
Is 8153 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8153 a prime number?
No. 8153 = 31 × 263, so it is divisible by 31.
What are the factors of 8153?
1, 31, 263, 8153.
What is 8153 in binary?
1111111011001 (hexadecimal 1FD9, octal 17731).
What is the square root of 8153?
About 90.2940.
Is 8153 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 8153?
8153 is a semiprime: 31 × 263, the product of two primes.