The number 13153
13153 is a composite number with 4 divisors. Its prime factorisation is 7 × 1879. Divisors (4): 1, 7, 1879, 13153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13153: a semiprime: 7 × 1879, the product of two primes.
- 2
13153 is composite. Its prime factorisation is
- 3
The divisors add up to 15040; without 13153 itself that is 1887, so 13153 is deficient (1887 is less than 13153). Euler's totient φ(13153) = 11268 numbers up to 13153 share no factor with it.
- 4
The digits of 13153 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13153 = 7 \times 1879 \]
13153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15040 |
| Euler totient φ(n) | 11268 |
| Square | 173001409 |
| Cube | 2275487532577 |
| Square root | 114.686529 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 99 |
| Scientific notation | 1.3153 × |
13153 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and fifty-three |
| Binary (base 2) | 11001101100001 |
| Octal (base 8) | 31541 |
| Hexadecimal (base 16) | 3361 |
| Base 3 | 200001011 |
| As time | 13153 seconds = 3 h 39 min 13 s |
Is 13153 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 | Yes (13153 ÷ 7 = 1879) | 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 4) | 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 8) | 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 13153 a prime number?
No. 13153 = 7 × 1879, so it is divisible by 7.
What are the factors of 13153?
1, 7, 1879, 13153.
What is 13153 in binary?
11001101100001 (hexadecimal 3361, octal 31541).
What is the square root of 13153?
About 114.6865.
Is 13153 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 13153?
13153 is a semiprime: 7 × 1879, the product of two primes.