The number 47906
47906 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1409. Divisors (8): 1, 2, 17, 34, 1409, 2818, 23953, 47906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47906 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47906 is composite. Its prime factorisation is
- 3
The divisors add up to 76140; without 47906 itself that is 28234, so 47906 is deficient (28234 is less than 47906). Euler's totient φ(47906) = 22528 numbers up to 47906 share no factor with it.
- 4
The digits of 47906 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47906 = 2 \times 17 \times 1409 \]
47906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76140 |
| Euler totient φ(n) | 22528 |
| Square | 2294984836 |
| Cube | 109943543553416 |
| Square root | 218.874393 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7906 × |
47906 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and six |
| Binary (base 2) | 1011101100100010 |
| Octal (base 8) | 135442 |
| Hexadecimal (base 16) | BB22 |
| Base 3 | 2102201022 |
| As time | 47906 seconds = 13 h 18 min 26 s |
Is 47906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47906 ÷ 2 = 23953) | 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 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47906 a prime number?
No. 47906 = 2 × 17 × 1409, so it is divisible by 2.
What are the factors of 47906?
1, 2, 17, 34, 1409, 2818, 23953, 47906.
What is 47906 in binary?
1011101100100010 (hexadecimal BB22, octal 135442).
What is the square root of 47906?
About 218.8744.
Is 47906 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 47906?
It is a composite number with 8 divisors.