The number 47611
47611 is a composite number with 4 divisors. Its prime factorisation is 47 × 1013. Divisors (4): 1, 47, 1013, 47611.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47611: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1013, the product of two primes.
- 2
47611 is composite. Its prime factorisation is
- 3
The divisors add up to 48672; without 47611 itself that is 1061, so 47611 is deficient (1061 is less than 47611). Euler's totient φ(47611) = 46552 numbers up to 47611 share no factor with it.
- 4
The digits of 47611 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47611 = 47 \times 1013 \]
47611 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48672 |
| Euler totient φ(n) | 46552 |
| Square | 2266807321 |
| Cube | 107924963360131 |
| Square root | 218.199450 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7611 × |
47611 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand six hundred and eleven |
| Binary (base 2) | 1011100111111011 |
| Octal (base 8) | 134773 |
| Hexadecimal (base 16) | B9FB |
| Base 3 | 2102022101 |
| As time | 47611 seconds = 13 h 13 min 31 s |
Is 47611 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 | No (remainder 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47611 a prime number?
No. 47611 = 47 × 1013, so it is divisible by 47.
What are the factors of 47611?
1, 47, 1013, 47611.
What is 47611 in binary?
1011100111111011 (hexadecimal B9FB, octal 134773).
What is the square root of 47611?
About 218.1995.
Is 47611 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 47611?
47611 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1013, the product of two primes.