The number 15553
15553 is a composite number with 4 divisors. Its prime factorisation is 103 × 151. Divisors (4): 1, 103, 151, 15553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15553: a semiprime: 103 × 151, the product of two primes.
- 2
15553 is composite. Its prime factorisation is
- 3
The divisors add up to 15808; without 15553 itself that is 255, so 15553 is deficient (255 is less than 15553). Euler's totient φ(15553) = 15300 numbers up to 15553 share no factor with it.
- 4
The digits of 15553 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15553 = 103 \times 151 \]
15553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15808 |
| Euler totient φ(n) | 15300 |
| Square | 241895809 |
| Cube | 3762205517377 |
| Square root | 124.711667 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5553 × |
15553 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and fifty-three |
| Binary (base 2) | 11110011000001 |
| Octal (base 8) | 36301 |
| Hexadecimal (base 16) | 3CC1 |
| Base 3 | 210100001 |
| As time | 15553 seconds = 4 h 19 min 13 s |
Is 15553 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 6) | 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 1) | 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 10) | 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 15553 a prime number?
No. 15553 = 103 × 151, so it is divisible by 103.
What are the factors of 15553?
1, 103, 151, 15553.
What is 15553 in binary?
11110011000001 (hexadecimal 3CC1, octal 36301).
What is the square root of 15553?
About 124.7117.
Is 15553 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15553?
15553 is a semiprime: 103 × 151, the product of two primes.