The number 47914
47914 is a composite number with 4 divisors. Its prime factorisation is 2 × 23957. Divisors (4): 1, 2, 23957, 47914.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47914: a semiprime: 2 × 23957, the product of two primes.
- 2
47914 is composite. Its prime factorisation is
- 3
The divisors add up to 71874; without 47914 itself that is 23960, so 47914 is deficient (23960 is less than 47914). Euler's totient φ(47914) = 23956 numbers up to 47914 share no factor with it.
- 4
The digits of 47914 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47914 = 2 \times 23957 \]
47914 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71874 |
| Euler totient φ(n) | 23956 |
| Square | 2295751396 |
| Cube | 109998632387944 |
| Square root | 218.892668 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7914 × |
47914 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fourteen |
| Binary (base 2) | 1011101100101010 |
| Octal (base 8) | 135452 |
| Hexadecimal (base 16) | BB2A |
| Base 3 | 2102201121 |
| As time | 47914 seconds = 13 h 18 min 34 s |
Is 47914 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47914 ÷ 2 = 23957) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47914 a prime number?
No. 47914 = 2 × 23957, so it is divisible by 2.
What are the factors of 47914?
1, 2, 23957, 47914.
What is 47914 in binary?
1011101100101010 (hexadecimal BB2A, octal 135452).
What is the square root of 47914?
About 218.8927.
Is 47914 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 47914?
47914 is a semiprime: 2 × 23957, the product of two primes.