The number 47954
47954 is a composite number with 4 divisors. Its prime factorisation is 2 × 23977. Divisors (4): 1, 2, 23977, 47954.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47954: a semiprime: 2 × 23977, the product of two primes.
- 2
47954 is composite. Its prime factorisation is
- 3
The divisors add up to 71934; without 47954 itself that is 23980, so 47954 is deficient (23980 is less than 47954). Euler's totient φ(47954) = 23976 numbers up to 47954 share no factor with it.
- 4
The digits of 47954 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47954 = 2 \times 23977 \]
47954 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71934 |
| Euler totient φ(n) | 23976 |
| Square | 2299586116 |
| Cube | 110274352606664 |
| Square root | 218.984018 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7954 × |
47954 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-four |
| Binary (base 2) | 1011101101010010 |
| Octal (base 8) | 135522 |
| Hexadecimal (base 16) | BB52 |
| Base 3 | 2102210002 |
| As time | 47954 seconds = 13 h 19 min 14 s |
Is 47954 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47954 ÷ 2 = 23977) | 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 4) | 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 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 2) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 47954 a prime number?
No. 47954 = 2 × 23977, so it is divisible by 2.
What are the factors of 47954?
1, 2, 23977, 47954.
What is 47954 in binary?
1011101101010010 (hexadecimal BB52, octal 135522).
What is the square root of 47954?
About 218.9840.
Is 47954 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 47954?
47954 is a semiprime: 2 × 23977, the product of two primes.