The number 36953
36953 is a composite number with 4 divisors. Its prime factorisation is 7 × 5279. Divisors (4): 1, 7, 5279, 36953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36953: a semiprime: 7 × 5279, the product of two primes.
- 2
36953 is composite. Its prime factorisation is
- 3
The divisors add up to 42240; without 36953 itself that is 5287, so 36953 is deficient (5287 is less than 36953). Euler's totient φ(36953) = 31668 numbers up to 36953 share no factor with it.
- 4
The digits of 36953 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 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36953 = 7 \times 5279 \]
36953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42240 |
| Euler totient φ(n) | 31668 |
| Square | 1365524209 |
| Cube | 50460216095177 |
| Square root | 192.231631 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6953 × |
36953 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-three |
| Binary (base 2) | 1001000001011001 |
| Octal (base 8) | 110131 |
| Hexadecimal (base 16) | 9059 |
| Base 3 | 1212200122 |
| As time | 36953 seconds = 10 h 15 min 53 s |
Is 36953 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 | Yes (36953 ÷ 7 = 5279) | 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 4) | 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 36953 a prime number?
No. 36953 = 7 × 5279, so it is divisible by 7.
What are the factors of 36953?
1, 7, 5279, 36953.
What is 36953 in binary?
1001000001011001 (hexadecimal 9059, octal 110131).
What is the square root of 36953?
About 192.2316.
Is 36953 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 36953?
36953 is a semiprime: 7 × 5279, the product of two primes.