The number 36915
36915 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 23 × 107. Divisors (16): 1, 3, 5, 15, 23, 69, 107, 115, 321, 345, 535, 1605, 2461, 7383, 12305, 36915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36915 is composite. Its prime factorisation is
- 3
The divisors add up to 62208; without 36915 itself that is 25293, so 36915 is deficient (25293 is less than 36915). Euler's totient φ(36915) = 18656 numbers up to 36915 share no factor with it.
- 4
The digits of 36915 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 80 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36915 = 3 \times 5 \times 23 \times 107 \]
36915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 62208 |
| Euler totient φ(n) | 18656 |
| Square | 1362717225 |
| Cube | 50304706360875 |
| Square root | 192.132767 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 80 |
| Scientific notation | 3.6915 × |
36915 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifteen |
| Binary (base 2) | 1001000000110011 |
| Octal (base 8) | 110063 |
| Hexadecimal (base 16) | 9033 |
| Base 3 | 1212122020 |
| As time | 36915 seconds = 10 h 15 min 15 s |
Is 36915 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 (36915 ÷ 3 = 12305) | 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 | Yes (36915 ÷ 5 = 7383) | 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 | No (remainder 4) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36915 a prime number?
No. 36915 = 3 × 5 × 23 × 107, so it is divisible by 3.
What are the factors of 36915?
1, 3, 5, 15, 23, 69, 107, 115, 321, 345, 535, 1605, 2461, 7383, 12305, 36915.
What is 36915 in binary?
1001000000110011 (hexadecimal 9033, octal 110063).
What is the square root of 36915?
About 192.1328.
Is 36915 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 36915?
It is a composite number with 16 divisors.