The number 47953
47953 is a composite number with 4 divisors. Its prime factorisation is 79 × 607. Divisors (4): 1, 79, 607, 47953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47953: a semiprime: 79 × 607, the product of two primes.
- 2
47953 is composite. Its prime factorisation is
- 3
The divisors add up to 48640; without 47953 itself that is 687, so 47953 is deficient (687 is less than 47953). Euler's totient φ(47953) = 47268 numbers up to 47953 share no factor with it.
- 4
The digits of 47953 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47953 = 79 \times 607 \]
47953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48640 |
| Euler totient φ(n) | 47268 |
| Square | 2299490209 |
| Cube | 110267453992177 |
| Square root | 218.981734 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7953 × |
47953 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-three |
| Binary (base 2) | 1011101101010001 |
| Octal (base 8) | 135521 |
| Hexadecimal (base 16) | BB51 |
| Base 3 | 2102210001 |
| As time | 47953 seconds = 13 h 19 min 13 s |
Is 47953 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47953 a prime number?
No. 47953 = 79 × 607, so it is divisible by 79.
What are the factors of 47953?
1, 79, 607, 47953.
What is 47953 in binary?
1011101101010001 (hexadecimal BB51, octal 135521).
What is the square root of 47953?
About 218.9817.
Is 47953 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 47953?
47953 is a semiprime: 79 × 607, the product of two primes.