The number 62381
62381 is a composite number with 8 divisors. Its prime factorisation is 11 × 53 × 107. Divisors (8): 1, 11, 53, 107, 583, 1177, 5671, 62381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
62381 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
62381 is composite. Its prime factorisation is
- 3
The divisors add up to 69984; without 62381 itself that is 7603, so 62381 is deficient (7603 is less than 62381). Euler's totient φ(62381) = 55120 numbers up to 62381 share no factor with it.
- 4
The digits of 62381 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 223 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62381 = 11 \times 53 \times 107 \]
62381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69984 |
| Euler totient φ(n) | 55120 |
| Square | 3891389161 |
| Cube | 242748747252341 |
| Square root | 249.761887 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 223 |
| Scientific notation | 6.2381 × |
62381 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand three hundred and eighty-one |
| Binary (base 2) | 1111001110101101 |
| Octal (base 8) | 171655 |
| Hexadecimal (base 16) | F3AD |
| Base 3 | 10011120102 |
| As time | 62381 seconds = 17 h 19 min 41 s |
Is 62381 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 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 (62381 ÷ 11 = 5671) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62381 a prime number?
No. 62381 = 11 × 53 × 107, so it is divisible by 11.
What are the factors of 62381?
1, 11, 53, 107, 583, 1177, 5671, 62381.
What is 62381 in binary?
1111001110101101 (hexadecimal F3AD, octal 171655).
What is the square root of 62381?
About 249.7619.
Is 62381 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 62381?
It is a composite number with 8 divisors.