The number 47151
47151 is a composite number with 18 divisors. Its prime factorisation is × × 31. Divisors (18): 1, 3, 9, 13, 31, 39, 93, 117, 169, 279, 403, 507, 1209, 1521, 3627, 5239 … 47151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47151 is composite. Its prime factorisation is
- 3
The divisors add up to 76128; without 47151 itself that is 28977, so 47151 is deficient (28977 is less than 47151). Euler's totient φ(47151) = 28080 numbers up to 47151 share no factor with it.
- 4
The digits of 47151 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47151 = 3^{2} \times 13^{2} \times 31 \]47151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 76128 |
| Euler totient φ(n) | 28080 |
| Square | 2223216801 |
| Cube | 104826895383951 |
| Square root | 217.142810 (= 39√31) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.7151 × |
47151 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand one hundred and fifty-one |
| Binary (base 2) | 1011100000101111 |
| Octal (base 8) | 134057 |
| Hexadecimal (base 16) | B82F |
| Base 3 | 2101200100 |
| As time | 47151 seconds = 13 h 5 min 51 s |
Is 47151 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 (47151 ÷ 3 = 15717) | 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 1) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (47151 ÷ 9 = 5239) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 47151 a prime number?
No. 47151 = × × 31, so it is divisible by 3.
What are the factors of 47151?
1, 3, 9, 13, 31, 39, 93, 117, 169, 279, 403, 507, 1209, 1521, 3627, 5239, 15717, 47151.
What is 47151 in binary?
1011100000101111 (hexadecimal B82F, octal 134057).
What is the square root of 47151?
About 217.1428, exactly 39√31.
Is 47151 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 47151?
It is a composite number with 18 divisors.