The number 47130
47130 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1571. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1571, 3142, 4713, 7855, 9426, 15710, 23565, 47130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47130: a Harshad number: divisible by its digit sum 15.
- 2
47130 is composite. Its prime factorisation is
- 3
The divisors add up to 113184; without 47130 itself that is 66054, so 47130 is abundant (66054 is more than 47130). Euler's totient φ(47130) = 12560 numbers up to 47130 share no factor with it.
- 4
The digits of 47130 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47130 = 2 \times 3 \times 5 \times 1571 \]
47130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113184 |
| Euler totient φ(n) | 12560 |
| Square | 2221236900 |
| Cube | 104686895097000 |
| Square root | 217.094449 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.713 × |
47130 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand one hundred and thirty |
| Binary (base 2) | 1011100000011010 |
| Octal (base 8) | 134032 |
| Hexadecimal (base 16) | B81A |
| Base 3 | 2101122120 |
| As time | 47130 seconds = 13 h 5 min 30 s |
Is 47130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47130 ÷ 2 = 23565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47130 ÷ 3 = 15710) | 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 (47130 ÷ 5 = 9426) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (47130 ÷ 6 = 7855) | 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 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 (47130 ÷ 10 = 4713) | 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 47130 a prime number?
No. 47130 = 2 × 3 × 5 × 1571, so it is divisible by 2.
What are the factors of 47130?
1, 2, 3, 5, 6, 10, 15, 30, 1571, 3142, 4713, 7855, 9426, 15710, 23565, 47130.
What is 47130 in binary?
1011100000011010 (hexadecimal B81A, octal 134032).
What is the square root of 47130?
About 217.0944.
Is 47130 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 47130?
47130 is a Harshad number: divisible by its digit sum 15.