The number 63253
63253 is a composite number with 4 divisors. Its prime factorisation is 43 × 1471. Divisors (4): 1, 43, 1471, 63253.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63253: a semiprime: 43 × 1471, the product of two primes.
- 2
63253 is composite. Its prime factorisation is
- 3
The divisors add up to 64768; without 63253 itself that is 1515, so 63253 is deficient (1515 is less than 63253). Euler's totient φ(63253) = 61740 numbers up to 63253 share no factor with it.
- 4
The digits of 63253 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63253 = 43 \times 1471 \]
63253 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64768 |
| Euler totient φ(n) | 61740 |
| Square | 4000942009 |
| Cube | 253071584895277 |
| Square root | 251.501491 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3253 × |
63253 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand two hundred and fifty-three |
| Binary (base 2) | 1111011100010101 |
| Octal (base 8) | 173425 |
| Hexadecimal (base 16) | F715 |
| Base 3 | 10012202201 |
| As time | 63253 seconds = 17 h 34 min 13 s |
Is 63253 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 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 5) | 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 3) | 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 63253 a prime number?
No. 63253 = 43 × 1471, so it is divisible by 43.
What are the factors of 63253?
1, 43, 1471, 63253.
What is 63253 in binary?
1111011100010101 (hexadecimal F715, octal 173425).
What is the square root of 63253?
About 251.5015.
Is 63253 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 63253?
63253 is a semiprime: 43 × 1471, the product of two primes.