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