The number 47909
47909 is a composite number with 4 divisors. Its prime factorisation is 23 × 2083. Divisors (4): 1, 23, 2083, 47909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47909: a semiprime: 23 × 2083, the product of two primes.
- 2
47909 is composite. Its prime factorisation is
- 3
The divisors add up to 50016; without 47909 itself that is 2107, so 47909 is deficient (2107 is less than 47909). Euler's totient φ(47909) = 45804 numbers up to 47909 share no factor with it.
- 4
The digits of 47909 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47909 = 23 \times 2083 \]
47909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50016 |
| Euler totient φ(n) | 45804 |
| Square | 2295272281 |
| Cube | 109964199710429 |
| Square root | 218.881246 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7909 × |
47909 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and nine |
| Binary (base 2) | 1011101100100101 |
| Octal (base 8) | 135445 |
| Hexadecimal (base 16) | BB25 |
| Base 3 | 2102201102 |
| As time | 47909 seconds = 13 h 18 min 29 s |
Is 47909 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 4) | 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 1) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 47909 a prime number?
No. 47909 = 23 × 2083, so it is divisible by 23.
What are the factors of 47909?
1, 23, 2083, 47909.
What is 47909 in binary?
1011101100100101 (hexadecimal BB25, octal 135445).
What is the square root of 47909?
About 218.8812.
Is 47909 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 47909?
47909 is a semiprime: 23 × 2083, the product of two primes.