The number 6331
6331 is a composite number with 4 divisors. Its prime factorisation is 13 × 487. Divisors (4): 1, 13, 487, 6331.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6331: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 487, the product of two primes.
- 2
6331 is composite. Its prime factorisation is
- 3
The divisors add up to 6832; without 6331 itself that is 501, so 6331 is deficient (501 is less than 6331). Euler's totient φ(6331) = 5832 numbers up to 6331 share no factor with it.
- 4
The digits of 6331 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 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6331 = 13 \times 487 \]
6331 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6832 |
| Euler totient φ(n) | 5832 |
| Square | 40081561 |
| Cube | 253756362691 |
| Square root | 79.567581 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 54 |
| Scientific notation | 6.331 × |
6331 in other forms
| Form | Value |
|---|---|
| In words | six thousand three hundred and thirty-one |
| Binary (base 2) | 1100010111011 |
| Octal (base 8) | 14273 |
| Hexadecimal (base 16) | 18BB |
| Base 3 | 22200111 |
| As time | 6331 seconds = 1 h 45 min 31 s |
Is 6331 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 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 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6331 a prime number?
No. 6331 = 13 × 487, so it is divisible by 13.
What are the factors of 6331?
1, 13, 487, 6331.
What is 6331 in binary?
1100010111011 (hexadecimal 18BB, octal 14273).
What is the square root of 6331?
About 79.5676.
Is 6331 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 6331?
6331 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 487, the product of two primes.