The number 47919
47919 is a composite number with 4 divisors. Its prime factorisation is 3 × 15973. Divisors (4): 1, 3, 15973, 47919.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47919: a semiprime: 3 × 15973, the product of two primes.
- 2
47919 is composite. Its prime factorisation is
- 3
The divisors add up to 63896; without 47919 itself that is 15977, so 47919 is deficient (15977 is less than 47919). Euler's totient φ(47919) = 31944 numbers up to 47919 share no factor with it.
- 4
The digits of 47919 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47919 = 3 \times 15973 \]
47919 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63896 |
| Euler totient φ(n) | 31944 |
| Square | 2296230561 |
| Cube | 110033072252559 |
| Square root | 218.904089 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.7919 × |
47919 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and nineteen |
| Binary (base 2) | 1011101100101111 |
| Octal (base 8) | 135457 |
| Hexadecimal (base 16) | BB2F |
| Base 3 | 2102201210 |
| As time | 47919 seconds = 13 h 18 min 39 s |
Is 47919 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 (47919 ÷ 3 = 15973) | 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 4) | 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 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 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 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47919 a prime number?
No. 47919 = 3 × 15973, so it is divisible by 3.
What are the factors of 47919?
1, 3, 15973, 47919.
What is 47919 in binary?
1011101100101111 (hexadecimal BB2F, octal 135457).
What is the square root of 47919?
About 218.9041.
Is 47919 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 47919?
47919 is a semiprime: 3 × 15973, the product of two primes.