The number 42270
42270 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1409. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1409, 2818, 4227, 7045, 8454, 14090, 21135, 42270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42270: a Harshad number: divisible by its digit sum 15.
- 2
42270 is composite. Its prime factorisation is
- 3
The divisors add up to 101520; without 42270 itself that is 59250, so 42270 is abundant (59250 is more than 42270). Euler's totient φ(42270) = 11264 numbers up to 42270 share no factor with it.
- 4
The digits of 42270 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 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42270 = 2 \times 3 \times 5 \times 1409 \]
42270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 101520 |
| Euler totient φ(n) | 11264 |
| Square | 1786752900 |
| Cube | 75526045083000 |
| Square root | 205.596693 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 62 |
| Scientific notation | 4.227 × |
42270 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand two hundred and seventy |
| Binary (base 2) | 1010010100011110 |
| Octal (base 8) | 122436 |
| Hexadecimal (base 16) | A51E |
| Base 3 | 2010222120 |
| As time | 42270 seconds = 11 h 44 min 30 s |
Is 42270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42270 ÷ 2 = 21135) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (42270 ÷ 3 = 14090) | 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 (42270 ÷ 5 = 8454) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (42270 ÷ 6 = 7045) | 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 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 (42270 ÷ 10 = 4227) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 42270 a prime number?
No. 42270 = 2 × 3 × 5 × 1409, so it is divisible by 2.
What are the factors of 42270?
1, 2, 3, 5, 6, 10, 15, 30, 1409, 2818, 4227, 7045, 8454, 14090, 21135, 42270.
What is 42270 in binary?
1010010100011110 (hexadecimal A51E, octal 122436).
What is the square root of 42270?
About 205.5967.
Is 42270 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 42270?
42270 is a Harshad number: divisible by its digit sum 15.