The number 45330
45330 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1511. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1511, 3022, 4533, 7555, 9066, 15110, 22665, 45330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45330: a Harshad number: divisible by its digit sum 15.
- 2
45330 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 45330 itself that is 63534, so 45330 is abundant (63534 is more than 45330). Euler's totient φ(45330) = 12080 numbers up to 45330 share no factor with it.
- 4
The digits of 45330 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45330 = 2 \times 3 \times 5 \times 1511 \]
45330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 12080 |
| Square | 2054808900 |
| Cube | 93144487437000 |
| Square root | 212.908431 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.533 × |
45330 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand three hundred and thirty |
| Binary (base 2) | 1011000100010010 |
| Octal (base 8) | 130422 |
| Hexadecimal (base 16) | B112 |
| Base 3 | 2022011220 |
| As time | 45330 seconds = 12 h 35 min 30 s |
Is 45330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (45330 ÷ 2 = 22665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (45330 ÷ 3 = 15110) | 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 (45330 ÷ 5 = 9066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (45330 ÷ 6 = 7555) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (45330 ÷ 10 = 4533) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 45330 a prime number?
No. 45330 = 2 × 3 × 5 × 1511, so it is divisible by 2.
What are the factors of 45330?
1, 2, 3, 5, 6, 10, 15, 30, 1511, 3022, 4533, 7555, 9066, 15110, 22665, 45330.
What is 45330 in binary?
1011000100010010 (hexadecimal B112, octal 130422).
What is the square root of 45330?
About 212.9084.
Is 45330 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 45330?
45330 is a Harshad number: divisible by its digit sum 15.