The number 15055
15055 is a composite number with 4 divisors. Its prime factorisation is 5 × 3011. Divisors (4): 1, 5, 3011, 15055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15055: a semiprime: 5 × 3011, the product of two primes.
- 2
15055 is composite. Its prime factorisation is
- 3
The divisors add up to 18072; without 15055 itself that is 3017, so 15055 is deficient (3017 is less than 15055). Euler's totient φ(15055) = 12040 numbers up to 15055 share no factor with it.
- 4
The digits of 15055 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15055 = 5 \times 3011 \]
15055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18072 |
| Euler totient φ(n) | 12040 |
| Square | 226653025 |
| Cube | 3412261291375 |
| Square root | 122.698818 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.5055 × |
15055 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-five |
| Binary (base 2) | 11101011001111 |
| Octal (base 8) | 35317 |
| Hexadecimal (base 16) | 3ACF |
| Base 3 | 202122121 |
| As time | 15055 seconds = 4 h 10 min 55 s |
Is 15055 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15055 ÷ 5 = 3011) | 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 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 7) | 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 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15055 a prime number?
No. 15055 = 5 × 3011, so it is divisible by 5.
What are the factors of 15055?
1, 5, 3011, 15055.
What is 15055 in binary?
11101011001111 (hexadecimal 3ACF, octal 35317).
What is the square root of 15055?
About 122.6988.
Is 15055 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15055?
15055 is a semiprime: 5 × 3011, the product of two primes.