The number 15630
15630 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 521. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 521, 1042, 1563, 2605, 3126, 5210, 7815, 15630.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15630: a Harshad number: divisible by its digit sum 15.
- 2
15630 is composite. Its prime factorisation is
- 3
The divisors add up to 37584; without 15630 itself that is 21954, so 15630 is abundant (21954 is more than 15630). Euler's totient φ(15630) = 4160 numbers up to 15630 share no factor with it.
- 4
The digits of 15630 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15630 = 2 \times 3 \times 5 \times 521 \]
15630 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 37584 |
| Euler totient φ(n) | 4160 |
| Square | 244296900 |
| Cube | 3818360547000 |
| Square root | 125.019998 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.563 × |
15630 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and thirty |
| Binary (base 2) | 11110100001110 |
| Octal (base 8) | 36416 |
| Hexadecimal (base 16) | 3D0E |
| Base 3 | 210102220 |
| As time | 15630 seconds = 4 h 20 min 30 s |
Is 15630 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15630 ÷ 2 = 7815) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15630 ÷ 3 = 5210) | 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 (15630 ÷ 5 = 3126) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15630 ÷ 6 = 2605) | 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 | No (remainder 6) | 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 (15630 ÷ 10 = 1563) | 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 15630 a prime number?
No. 15630 = 2 × 3 × 5 × 521, so it is divisible by 2.
What are the factors of 15630?
1, 2, 3, 5, 6, 10, 15, 30, 521, 1042, 1563, 2605, 3126, 5210, 7815, 15630.
What is 15630 in binary?
11110100001110 (hexadecimal 3D0E, octal 36416).
What is the square root of 15630?
About 125.0200.
Is 15630 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15630?
15630 is a Harshad number: divisible by its digit sum 15.