The number 15056
15056 is a composite number with 10 divisors. Its prime factorisation is × 941. Divisors (10): 1, 2, 4, 8, 16, 941, 1882, 3764, 7528, 15056.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15056 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15056 is composite. Its prime factorisation is
- 3
The divisors add up to 29202; without 15056 itself that is 14146, so 15056 is deficient (14146 is less than 15056). Euler's totient φ(15056) = 7520 numbers up to 15056 share no factor with it.
- 4
The digits of 15056 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15056 = 2^{4} \times 941 \]15056 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 29202 |
| Euler totient φ(n) | 7520 |
| Square | 226683136 |
| Cube | 3412941295616 |
| Square root | 122.702893 (= 4√941) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5056 × |
15056 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-six |
| Binary (base 2) | 11101011010000 |
| Octal (base 8) | 35320 |
| Hexadecimal (base 16) | 3AD0 |
| Base 3 | 202122122 |
| As time | 15056 seconds = 4 h 10 min 56 s |
Is 15056 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15056 ÷ 2 = 7528) | 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 | Yes (15056 ÷ 4 = 3764) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | Yes (15056 ÷ 8 = 1882) | 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 6) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15056 a prime number?
No. 15056 = × 941, so it is divisible by 2.
What are the factors of 15056?
1, 2, 4, 8, 16, 941, 1882, 3764, 7528, 15056.
What is 15056 in binary?
11101011010000 (hexadecimal 3AD0, octal 35320).
What is the square root of 15056?
About 122.7029, exactly 4√941.
Is 15056 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15056?
It is a composite number with 10 divisors.