The number 53063
53063 is a composite number with 4 divisors. Its prime factorisation is 47 × 1129. Divisors (4): 1, 47, 1129, 53063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53063: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1129, the product of two primes.
- 2
53063 is composite. Its prime factorisation is
- 3
The divisors add up to 54240; without 53063 itself that is 1177, so 53063 is deficient (1177 is less than 53063). Euler's totient φ(53063) = 51888 numbers up to 53063 share no factor with it.
- 4
The digits of 53063 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53063 = 47 \times 1129 \]
53063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54240 |
| Euler totient φ(n) | 51888 |
| Square | 2815681969 |
| Cube | 149408532321047 |
| Square root | 230.354075 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3063 × |
53063 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-three |
| Binary (base 2) | 1100111101000111 |
| Octal (base 8) | 147507 |
| Hexadecimal (base 16) | CF47 |
| Base 3 | 2200210022 |
| As time | 53063 seconds = 14 h 44 min 23 s |
Is 53063 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 10) | 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 53063 a prime number?
No. 53063 = 47 × 1129, so it is divisible by 47.
What are the factors of 53063?
1, 47, 1129, 53063.
What is 53063 in binary?
1100111101000111 (hexadecimal CF47, octal 147507).
What is the square root of 53063?
About 230.3541.
Is 53063 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 53063?
53063 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1129, the product of two primes.