The number 62391
62391 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2971. Divisors (8): 1, 3, 7, 21, 2971, 8913, 20797, 62391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62391: a Harshad number: divisible by its digit sum 21.
- 2
62391 is composite. Its prime factorisation is
- 3
The divisors add up to 95104; without 62391 itself that is 32713, so 62391 is deficient (32713 is less than 62391). Euler's totient φ(62391) = 35640 numbers up to 62391 share no factor with it.
- 4
The digits of 62391 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62391 = 3 \times 7 \times 2971 \]
62391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95104 |
| Euler totient φ(n) | 35640 |
| Square | 3892636881 |
| Cube | 242865507642471 |
| Square root | 249.781905 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 210 |
| Scientific notation | 6.2391 × |
62391 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand three hundred and ninety-one |
| Binary (base 2) | 1111001110110111 |
| Octal (base 8) | 171667 |
| Hexadecimal (base 16) | F3B7 |
| Base 3 | 10011120210 |
| As time | 62391 seconds = 17 h 19 min 51 s |
Is 62391 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 | Yes (62391 ÷ 3 = 20797) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (62391 ÷ 7 = 8913) | 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 3) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 62391 a prime number?
No. 62391 = 3 × 7 × 2971, so it is divisible by 3.
What are the factors of 62391?
1, 3, 7, 21, 2971, 8913, 20797, 62391.
What is 62391 in binary?
1111001110110111 (hexadecimal F3B7, octal 171667).
What is the square root of 62391?
About 249.7819.
Is 62391 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 62391?
62391 is a Harshad number: divisible by its digit sum 21.