The number 36813
36813 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1753. Divisors (8): 1, 3, 7, 21, 1753, 5259, 12271, 36813.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36813: a Harshad number: divisible by its digit sum 21.
- 2
36813 is composite. Its prime factorisation is
- 3
The divisors add up to 56128; without 36813 itself that is 19315, so 36813 is deficient (19315 is less than 36813). Euler's totient φ(36813) = 21024 numbers up to 36813 share no factor with it.
- 4
The digits of 36813 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 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36813 = 3 \times 7 \times 1753 \]
36813 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56128 |
| Euler totient φ(n) | 21024 |
| Square | 1355196969 |
| Cube | 49888866019797 |
| Square root | 191.867142 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 62 |
| Scientific notation | 3.6813 × |
36813 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand eight hundred and thirteen |
| Binary (base 2) | 1000111111001101 |
| Octal (base 8) | 107715 |
| Hexadecimal (base 16) | 8FCD |
| Base 3 | 1212111110 |
| As time | 36813 seconds = 10 h 13 min 33 s |
Is 36813 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 (36813 ÷ 3 = 12271) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (36813 ÷ 7 = 5259) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36813 a prime number?
No. 36813 = 3 × 7 × 1753, so it is divisible by 3.
What are the factors of 36813?
1, 3, 7, 21, 1753, 5259, 12271, 36813.
What is 36813 in binary?
1000111111001101 (hexadecimal 8FCD, octal 107715).
What is the square root of 36813?
About 191.8671.
Is 36813 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 36813?
36813 is a Harshad number: divisible by its digit sum 21.