The number 47631
47631 is a composite number with 4 divisors. Its prime factorisation is 3 × 15877. Divisors (4): 1, 3, 15877, 47631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47631: a semiprime: 3 × 15877, the product of two primes.
- 2
47631 is composite. Its prime factorisation is
- 3
The divisors add up to 63512; without 47631 itself that is 15881, so 47631 is deficient (15881 is less than 47631). Euler's totient φ(47631) = 31752 numbers up to 47631 share no factor with it.
- 4
The digits of 47631 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47631 = 3 \times 15877 \]
47631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63512 |
| Euler totient φ(n) | 31752 |
| Square | 2268712161 |
| Cube | 108061028940591 |
| Square root | 218.245275 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.7631 × |
47631 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and thirty-one |
| Binary (base 2) | 1011101000001111 |
| Octal (base 8) | 135017 |
| Hexadecimal (base 16) | BA0F |
| Base 3 | 2102100010 |
| As time | 47631 seconds = 13 h 13 min 51 s |
Is 47631 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 (47631 ÷ 3 = 15877) | 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 3) | 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 | No (remainder 3) | 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 1) | 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 47631 a prime number?
No. 47631 = 3 × 15877, so it is divisible by 3.
What are the factors of 47631?
1, 3, 15877, 47631.
What is 47631 in binary?
1011101000001111 (hexadecimal BA0F, octal 135017).
What is the square root of 47631?
About 218.2453.
Is 47631 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 47631?
47631 is a semiprime: 3 × 15877, the product of two primes.