The number 4763
4763 is a composite number with 4 divisors. Its prime factorisation is 11 × 433. Divisors (4): 1, 11, 433, 4763.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4763: a semiprime: 11 × 433, the product of two primes.
- 2
4763 is composite. Its prime factorisation is
- 3
The divisors add up to 5208; without 4763 itself that is 445, so 4763 is deficient (445 is less than 4763). Euler's totient φ(4763) = 4320 numbers up to 4763 share no factor with it.
- 4
The digits of 4763 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 196 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4763 = 11 \times 433 \]
4763 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5208 |
| Euler totient φ(n) | 4320 |
| Square | 22686169 |
| Cube | 108054222947 |
| Square root | 69.014491 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 196 |
| Scientific notation | 4.763 × |
4763 in other forms
| Form | Value |
|---|---|
| In words | four thousand seven hundred and sixty-three |
| Binary (base 2) | 1001010011011 |
| Octal (base 8) | 11233 |
| Hexadecimal (base 16) | 129B |
| Base 3 | 20112102 |
| As time | 4763 seconds = 1 h 19 min 23 s |
Is 4763 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 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 5) | 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 3) | 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 | Yes (4763 ÷ 11 = 433) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4763 a prime number?
No. 4763 = 11 × 433, so it is divisible by 11.
What are the factors of 4763?
1, 11, 433, 4763.
What is 4763 in binary?
1001010011011 (hexadecimal 129B, octal 11233).
What is the square root of 4763?
About 69.0145.
Is 4763 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 4763?
4763 is a semiprime: 11 × 433, the product of two primes.