The number 67913
67913 is a composite number with 4 divisors. Its prime factorisation is 113 × 601. Divisors (4): 1, 113, 601, 67913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 67913: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 601, the product of two primes.
- 2
67913 is composite. Its prime factorisation is
- 3
The divisors add up to 68628; without 67913 itself that is 715, so 67913 is deficient (715 is less than 67913). Euler's totient φ(67913) = 67200 numbers up to 67913 share no factor with it.
- 4
The digits of 67913 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67913 = 113 \times 601 \]
67913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68628 |
| Euler totient φ(n) | 67200 |
| Square | 4612175569 |
| Cube | 313226679417497 |
| Square root | 260.601228 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.7913 × |
67913 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and thirteen |
| Binary (base 2) | 10000100101001001 |
| Octal (base 8) | 204511 |
| Hexadecimal (base 16) | 10949 |
| Base 3 | 10110011022 |
| As time | 67913 seconds = 18 h 51 min 53 s |
Is 67913 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 3) | 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 6) | 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 8) | 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 10) | 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 67913 a prime number?
No. 67913 = 113 × 601, so it is divisible by 113.
What are the factors of 67913?
1, 113, 601, 67913.
What is 67913 in binary?
10000100101001001 (hexadecimal 10949, octal 204511).
What is the square root of 67913?
About 260.6012.
Is 67913 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 67913?
67913 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 601, the product of two primes.