The number 63263
63263 is a composite number with 4 divisors. Its prime factorisation is 41 × 1543. Divisors (4): 1, 41, 1543, 63263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63263: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 1543, the product of two primes.
- 2
63263 is composite. Its prime factorisation is
- 3
The divisors add up to 64848; without 63263 itself that is 1585, so 63263 is deficient (1585 is less than 63263). Euler's totient φ(63263) = 61680 numbers up to 63263 share no factor with it.
- 4
The digits of 63263 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63263 = 41 \times 1543 \]
63263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64848 |
| Euler totient φ(n) | 61680 |
| Square | 4002207169 |
| Cube | 253191632132447 |
| Square root | 251.521371 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 6.3263 × |
63263 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand two hundred and sixty-three |
| Binary (base 2) | 1111011100011111 |
| Octal (base 8) | 173437 |
| Hexadecimal (base 16) | F71F |
| Base 3 | 10012210002 |
| As time | 63263 seconds = 17 h 34 min 23 s |
Is 63263 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 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 7) | 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 2) | 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 63263 a prime number?
No. 63263 = 41 × 1543, so it is divisible by 41.
What are the factors of 63263?
1, 41, 1543, 63263.
What is 63263 in binary?
1111011100011111 (hexadecimal F71F, octal 173437).
What is the square root of 63263?
About 251.5214.
Is 63263 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 63263?
63263 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 1543, the product of two primes.