The number 14130
14130 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 157. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 157, 314, 471, 785 … 14130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14130: a Harshad number: divisible by its digit sum 9.
- 2
14130 is composite. Its prime factorisation is
- 3
The divisors add up to 36972; without 14130 itself that is 22842, so 14130 is abundant (22842 is more than 14130). Euler's totient φ(14130) = 3744 numbers up to 14130 share no factor with it.
- 4
The digits of 14130 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14130 = 2 \times 3^{2} \times 5 \times 157 \]14130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 36972 |
| Euler totient φ(n) | 3744 |
| Square | 199656900 |
| Cube | 2821151997000 |
| Square root | 118.869677 (= 3√1570) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.413 × |
14130 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and thirty |
| Binary (base 2) | 11011100110010 |
| Octal (base 8) | 33462 |
| Hexadecimal (base 16) | 3732 |
| Base 3 | 201101100 |
| As time | 14130 seconds = 3 h 55 min 30 s |
Is 14130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14130 ÷ 2 = 7065) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14130 ÷ 3 = 4710) | 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 (14130 ÷ 5 = 2826) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14130 ÷ 6 = 2355) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (14130 ÷ 9 = 1570) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14130 ÷ 10 = 1413) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 14130 a prime number?
No. 14130 = 2 × × 5 × 157, so it is divisible by 2.
What are the factors of 14130?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 157, 314, 471, 785, 942, 1413, 1570, 2355, 2826, 4710, 7065, 14130.
What is 14130 in binary?
11011100110010 (hexadecimal 3732, octal 33462).
What is the square root of 14130?
About 118.8697, exactly 3√1570.
Is 14130 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14130?
14130 is a Harshad number: divisible by its digit sum 9.