The number 36763
36763 is a palindrome: it reads 36763 backwards too. Its prime factorisation is 97 × 379. Divisors (4): 1, 97, 379, 36763.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36763: a palindrome: it reads 36763 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 97 × 379, the product of two primes.
- 2
36763 is composite. Its prime factorisation is
- 3
The divisors add up to 37240; without 36763 itself that is 477, so 36763 is deficient (477 is less than 36763). Euler's totient φ(36763) = 36288 numbers up to 36763 share no factor with it.
- 4
The digits of 36763 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36763 = 97 \times 379 \]
36763 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 37240 |
| Euler totient φ(n) | 36288 |
| Square | 1351518169 |
| Cube | 49685862446947 |
| Square root | 191.736799 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6763 × |
36763 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand seven hundred and sixty-three |
| Binary (base 2) | 1000111110011011 |
| Octal (base 8) | 107633 |
| Hexadecimal (base 16) | 8F9B |
| Base 3 | 1212102121 |
| As time | 36763 seconds = 10 h 12 min 43 s |
Is 36763 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 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | 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 36763 a prime number?
No. 36763 = 97 × 379, so it is divisible by 97.
What are the factors of 36763?
1, 97, 379, 36763.
What is 36763 in binary?
1000111110011011 (hexadecimal 8F9B, octal 107633).
What is the square root of 36763?
About 191.7368.
Is 36763 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 36763?
36763 is a palindrome: it reads 36763 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 97 × 379, the product of two primes.