The number 66313
66313 is a composite number with 4 divisors. Its prime factorisation is 13 × 5101. Divisors (4): 1, 13, 5101, 66313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 66313: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5101, the product of two primes.
- 2
66313 is composite. Its prime factorisation is
- 3
The divisors add up to 71428; without 66313 itself that is 5115, so 66313 is deficient (5115 is less than 66313). Euler's totient φ(66313) = 61200 numbers up to 66313 share no factor with it.
- 4
The digits of 66313 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 66313 = 13 \times 5101 \]
66313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71428 |
| Euler totient φ(n) | 61200 |
| Square | 4397413969 |
| Cube | 291605712526297 |
| Square root | 257.513106 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.6313 × |
66313 in other forms
| Form | Value |
|---|---|
| In words | sixty-six thousand three hundred and thirteen |
| Binary (base 2) | 10000001100001001 |
| Octal (base 8) | 201411 |
| Hexadecimal (base 16) | 10309 |
| Base 3 | 10100222001 |
| As time | 66313 seconds = 18 h 25 min 13 s |
Is 66313 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 | No (remainder 2) | 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 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 5) | 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 66313 a prime number?
No. 66313 = 13 × 5101, so it is divisible by 13.
What are the factors of 66313?
1, 13, 5101, 66313.
What is 66313 in binary?
10000001100001001 (hexadecimal 10309, octal 201411).
What is the square root of 66313?
About 257.5131.
Is 66313 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 66313?
66313 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5101, the product of two primes.