The number 47153
47153 is a composite number with 4 divisors. Its prime factorisation is 61 × 773. Divisors (4): 1, 61, 773, 47153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47153: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 773, the product of two primes.
- 2
47153 is composite. Its prime factorisation is
- 3
The divisors add up to 47988; without 47153 itself that is 835, so 47153 is deficient (835 is less than 47153). Euler's totient φ(47153) = 46320 numbers up to 47153 share no factor with it.
- 4
The digits of 47153 add up to 20, 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
\[ 47153 = 61 \times 773 \]
47153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47988 |
| Euler totient φ(n) | 46320 |
| Square | 2223405409 |
| Cube | 104840235250577 |
| Square root | 217.147415 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7153 × |
47153 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand one hundred and fifty-three |
| Binary (base 2) | 1011100000110001 |
| Octal (base 8) | 134061 |
| Hexadecimal (base 16) | B831 |
| Base 3 | 2101200102 |
| As time | 47153 seconds = 13 h 5 min 53 s |
Is 47153 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 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 47153 a prime number?
No. 47153 = 61 × 773, so it is divisible by 61.
What are the factors of 47153?
1, 61, 773, 47153.
What is 47153 in binary?
1011100000110001 (hexadecimal B831, octal 134061).
What is the square root of 47153?
About 217.1474.
Is 47153 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 47153?
47153 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 773, the product of two primes.