The number 63481
63481 is a composite number with 8 divisors. Its prime factorisation is 11 × 29 × 199. Divisors (8): 1, 11, 29, 199, 319, 2189, 5771, 63481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
63481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
63481 is composite. Its prime factorisation is
- 3
The divisors add up to 72000; without 63481 itself that is 8519, so 63481 is deficient (8519 is less than 63481). Euler's totient φ(63481) = 55440 numbers up to 63481 share no factor with it.
- 4
The digits of 63481 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63481 = 11 \times 29 \times 199 \]
63481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72000 |
| Euler totient φ(n) | 55440 |
| Square | 4029837361 |
| Cube | 255818105513641 |
| Square root | 251.954361 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3481 × |
63481 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand four hundred and eighty-one |
| Binary (base 2) | 1111011111111001 |
| Octal (base 8) | 173771 |
| Hexadecimal (base 16) | F7F9 |
| Base 3 | 10020002011 |
| As time | 63481 seconds = 17 h 38 min 1 s |
Is 63481 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 1) | 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 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (63481 ÷ 11 = 5771) | 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 63481 a prime number?
No. 63481 = 11 × 29 × 199, so it is divisible by 11.
What are the factors of 63481?
1, 11, 29, 199, 319, 2189, 5771, 63481.
What is 63481 in binary?
1111011111111001 (hexadecimal F7F9, octal 173771).
What is the square root of 63481?
About 251.9544.
Is 63481 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 63481?
It is a composite number with 8 divisors.