The number 47263
47263 is a composite number with 4 divisors. Its prime factorisation is 151 × 313. Divisors (4): 1, 151, 313, 47263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47263: a semiprime: 151 × 313, the product of two primes.
- 2
47263 is composite. Its prime factorisation is
- 3
The divisors add up to 47728; without 47263 itself that is 465, so 47263 is deficient (465 is less than 47263). Euler's totient φ(47263) = 46800 numbers up to 47263 share no factor with it.
- 4
The digits of 47263 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47263 = 151 \times 313 \]
47263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47728 |
| Euler totient φ(n) | 46800 |
| Square | 2233791169 |
| Cube | 105575672020447 |
| Square root | 217.400552 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.7263 × |
47263 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand two hundred and sixty-three |
| Binary (base 2) | 1011100010011111 |
| Octal (base 8) | 134237 |
| Hexadecimal (base 16) | B89F |
| Base 3 | 2101211111 |
| As time | 47263 seconds = 13 h 7 min 43 s |
Is 47263 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 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47263 a prime number?
No. 47263 = 151 × 313, so it is divisible by 151.
What are the factors of 47263?
1, 151, 313, 47263.
What is 47263 in binary?
1011100010011111 (hexadecimal B89F, octal 134237).
What is the square root of 47263?
About 217.4006.
Is 47263 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 47263?
47263 is a semiprime: 151 × 313, the product of two primes.