The number 6013
6013 is a composite number with 4 divisors. Its prime factorisation is 7 × 859. Divisors (4): 1, 7, 859, 6013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6013: a semiprime: 7 × 859, the product of two primes.
- 2
6013 is composite. Its prime factorisation is
- 3
The divisors add up to 6880; without 6013 itself that is 867, so 6013 is deficient (867 is less than 6013). Euler's totient φ(6013) = 5148 numbers up to 6013 share no factor with it.
- 4
The digits of 6013 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6013 = 7 \times 859 \]
6013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6880 |
| Euler totient φ(n) | 5148 |
| Square | 36156169 |
| Cube | 217407044197 |
| Square root | 77.543536 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 142 |
| Scientific notation | 6.013 × |
6013 in other forms
| Form | Value |
|---|---|
| In words | six thousand and thirteen |
| Binary (base 2) | 1011101111101 |
| Octal (base 8) | 13575 |
| Hexadecimal (base 16) | 177D |
| Base 3 | 22020201 |
| As time | 6013 seconds = 1 h 40 min 13 s |
Is 6013 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 3) | 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 | Yes (6013 ÷ 7 = 859) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 6013 a prime number?
No. 6013 = 7 × 859, so it is divisible by 7.
What are the factors of 6013?
1, 7, 859, 6013.
What is 6013 in binary?
1011101111101 (hexadecimal 177D, octal 13575).
What is the square root of 6013?
About 77.5435.
Is 6013 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 6013?
6013 is a semiprime: 7 × 859, the product of two primes.