The number 30147
30147 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 773. Divisors (8): 1, 3, 13, 39, 773, 2319, 10049, 30147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30147 is composite. Its prime factorisation is
- 3
The divisors add up to 43344; without 30147 itself that is 13197, so 30147 is deficient (13197 is less than 30147). Euler's totient φ(30147) = 18528 numbers up to 30147 share no factor with it.
- 4
The digits of 30147 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 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30147 = 3 \times 13 \times 773 \]
30147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 43344 |
| Euler totient φ(n) | 18528 |
| Square | 908841609 |
| Cube | 27398847986523 |
| Square root | 173.628915 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 90 |
| Scientific notation | 3.0147 × |
30147 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand one hundred and forty-seven |
| Binary (base 2) | 111010111000011 |
| Octal (base 8) | 72703 |
| Hexadecimal (base 16) | 75C3 |
| Base 3 | 1112100120 |
| As time | 30147 seconds = 8 h 22 min 27 s |
Is 30147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30147 ÷ 3 = 10049) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30147 a prime number?
No. 30147 = 3 × 13 × 773, so it is divisible by 3.
What are the factors of 30147?
1, 3, 13, 39, 773, 2319, 10049, 30147.
What is 30147 in binary?
111010111000011 (hexadecimal 75C3, octal 72703).
What is the square root of 30147?
About 173.6289.
Is 30147 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30147?
It is a composite number with 8 divisors.