The number 15330
15330 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 73. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 73, 105 … 15330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15330 is composite. Its prime factorisation is
- 3
The divisors add up to 42624; without 15330 itself that is 27294, so 15330 is abundant (27294 is more than 15330). Euler's totient φ(15330) = 3456 numbers up to 15330 share no factor with it.
- 4
The digits of 15330 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15330 = 2 \times 3 \times 5 \times 7 \times 73 \]
15330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 42624 |
| Euler totient φ(n) | 3456 |
| Square | 235008900 |
| Cube | 3602686437000 |
| Square root | 123.814377 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.533 × |
15330 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and thirty |
| Binary (base 2) | 11101111100010 |
| Octal (base 8) | 35742 |
| Hexadecimal (base 16) | 3BE2 |
| Base 3 | 210000210 |
| As time | 15330 seconds = 4 h 15 min 30 s |
Is 15330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15330 ÷ 2 = 7665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15330 ÷ 3 = 5110) | 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 (15330 ÷ 5 = 3066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15330 ÷ 6 = 2555) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15330 ÷ 7 = 2190) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15330 ÷ 10 = 1533) | 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 15330 a prime number?
No. 15330 = 2 × 3 × 5 × 7 × 73, so it is divisible by 2.
What are the factors of 15330?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 73, 105, 146, 210, 219, 365, 438, 511, 730, 1022, 1095, 1533, 2190, 2555, 3066, 5110, 7665, 15330.
What is 15330 in binary?
11101111100010 (hexadecimal 3BE2, octal 35742).
What is the square root of 15330?
About 123.8144.
Is 15330 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15330?
15330 is a happy number: repeatedly adding the squares of its digits reaches 1.