The number 63371
63371 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 823. Divisors (8): 1, 7, 11, 77, 823, 5761, 9053, 63371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63371 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63371 is composite. Its prime factorisation is
- 3
The divisors add up to 79104; without 63371 itself that is 15733, so 63371 is deficient (15733 is less than 63371). Euler's totient φ(63371) = 49320 numbers up to 63371 share no factor with it.
- 4
The digits of 63371 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63371 = 7 \times 11 \times 823 \]
63371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79104 |
| Euler totient φ(n) | 49320 |
| Square | 4015883641 |
| Cube | 254490562213811 |
| Square root | 251.735973 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.3371 × |
63371 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand three hundred and seventy-one |
| Binary (base 2) | 1111011110001011 |
| Octal (base 8) | 173613 |
| Hexadecimal (base 16) | F78B |
| Base 3 | 10012221002 |
| As time | 63371 seconds = 17 h 36 min 11 s |
Is 63371 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 1) | 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 | Yes (63371 ÷ 7 = 9053) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (63371 ÷ 11 = 5761) | 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 63371 a prime number?
No. 63371 = 7 × 11 × 823, so it is divisible by 7.
What are the factors of 63371?
1, 7, 11, 77, 823, 5761, 9053, 63371.
What is 63371 in binary?
1111011110001011 (hexadecimal F78B, octal 173613).
What is the square root of 63371?
About 251.7360.
Is 63371 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 63371?
It is a composite number with 8 divisors.