The number 15550
15550 is a composite number with 12 divisors. Its prime factorisation is 2 × × 311. Divisors (12): 1, 2, 5, 10, 25, 50, 311, 622, 1555, 3110, 7775, 15550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15550 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15550 is composite. Its prime factorisation is
- 3
The divisors add up to 29016; without 15550 itself that is 13466, so 15550 is deficient (13466 is less than 15550). Euler's totient φ(15550) = 6200 numbers up to 15550 share no factor with it.
- 4
The digits of 15550 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15550 = 2 \times 5^{2} \times 311 \]15550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 29016 |
| Euler totient φ(n) | 6200 |
| Square | 241802500 |
| Cube | 3760028875000 |
| Square root | 124.699639 (= 5√622) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.555 × |
15550 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and fifty |
| Binary (base 2) | 11110010111110 |
| Octal (base 8) | 36276 |
| Hexadecimal (base 16) | 3CBE |
| Base 3 | 210022221 |
| As time | 15550 seconds = 4 h 19 min 10 s |
Is 15550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15550 ÷ 2 = 7775) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15550 ÷ 5 = 3110) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 | Yes (15550 ÷ 10 = 1555) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15550 a prime number?
No. 15550 = 2 × × 311, so it is divisible by 2.
What are the factors of 15550?
1, 2, 5, 10, 25, 50, 311, 622, 1555, 3110, 7775, 15550.
What is 15550 in binary?
11110010111110 (hexadecimal 3CBE, octal 36276).
What is the square root of 15550?
About 124.6996, exactly 5√622.
Is 15550 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15550?
It is a composite number with 12 divisors.