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