The number 42130
42130 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 383. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 383, 766, 1915, 3830, 4213, 8426, 21065, 42130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42130: a Harshad number: divisible by its digit sum 10.
- 2
42130 is composite. Its prime factorisation is
- 3
The divisors add up to 82944; without 42130 itself that is 40814, so 42130 is deficient (40814 is less than 42130). Euler's totient φ(42130) = 15280 numbers up to 42130 share no factor with it.
- 4
The digits of 42130 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42130 = 2 \times 5 \times 11 \times 383 \]
42130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82944 |
| Euler totient φ(n) | 15280 |
| Square | 1774936900 |
| Cube | 74778091597000 |
| Square root | 205.255938 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 106 |
| Scientific notation | 4.213 × |
42130 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand one hundred and thirty |
| Binary (base 2) | 1010010010010010 |
| Octal (base 8) | 122222 |
| Hexadecimal (base 16) | A492 |
| Base 3 | 2010210101 |
| As time | 42130 seconds = 11 h 42 min 10 s |
Is 42130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42130 ÷ 2 = 21065) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (42130 ÷ 5 = 8426) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (42130 ÷ 10 = 4213) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (42130 ÷ 11 = 3830) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42130 a prime number?
No. 42130 = 2 × 5 × 11 × 383, so it is divisible by 2.
What are the factors of 42130?
1, 2, 5, 10, 11, 22, 55, 110, 383, 766, 1915, 3830, 4213, 8426, 21065, 42130.
What is 42130 in binary?
1010010010010010 (hexadecimal A492, octal 122222).
What is the square root of 42130?
About 205.2559.
Is 42130 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 42130?
42130 is a Harshad number: divisible by its digit sum 10.