The number 15066
15066 is a composite number with 24 divisors. Its prime factorisation is 2 × × 31. Divisors (24): 1, 2, 3, 6, 9, 18, 27, 31, 54, 62, 81, 93, 162, 186, 243, 279 … 15066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15066: a Harshad number: divisible by its digit sum 18.
- 2
15066 is composite. Its prime factorisation is
- 3
The divisors add up to 34944; without 15066 itself that is 19878, so 15066 is abundant (19878 is more than 15066). Euler's totient φ(15066) = 4860 numbers up to 15066 share no factor with it.
- 4
The digits of 15066 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15066 = 2 \times 3^{5} \times 31 \]15066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 34944 |
| Euler totient φ(n) | 4860 |
| Square | 226984356 |
| Cube | 3419746307496 |
| Square root | 122.743635 (= 9√186) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5066 × |
15066 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-six |
| Binary (base 2) | 11101011011010 |
| Octal (base 8) | 35332 |
| Hexadecimal (base 16) | 3ADA |
| Base 3 | 202200000 |
| As time | 15066 seconds = 4 h 11 min 6 s |
Is 15066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15066 ÷ 2 = 7533) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15066 ÷ 3 = 5022) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15066 ÷ 6 = 2511) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15066 ÷ 9 = 1674) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15066 a prime number?
No. 15066 = 2 × × 31, so it is divisible by 2.
What are the factors of 15066?
1, 2, 3, 6, 9, 18, 27, 31, 54, 62, 81, 93, 162, 186, 243, 279, 486, 558, 837, 1674, 2511, 5022, 7533, 15066.
What is 15066 in binary?
11101011011010 (hexadecimal 3ADA, octal 35332).
What is the square root of 15066?
About 122.7436, exactly 9√186.
Is 15066 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15066?
15066 is a Harshad number: divisible by its digit sum 18.