The number 36948
36948 is a composite number with 12 divisors. Its prime factorisation is × 3 × 3079. Divisors (12): 1, 2, 3, 4, 6, 12, 3079, 6158, 9237, 12316, 18474, 36948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36948 is composite. Its prime factorisation is
- 3
The divisors add up to 86240; without 36948 itself that is 49292, so 36948 is abundant (49292 is more than 36948). Euler's totient φ(36948) = 12312 numbers up to 36948 share no factor with it.
- 4
The digits of 36948 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36948 = 2^{2} \times 3 \times 3079 \]36948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86240 |
| Euler totient φ(n) | 12312 |
| Square | 1365154704 |
| Cube | 50439736003392 |
| Square root | 192.218626 (= 2√9237) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 36 |
| Scientific notation | 3.6948 × |
36948 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and forty-eight |
| Binary (base 2) | 1001000001010100 |
| Octal (base 8) | 110124 |
| Hexadecimal (base 16) | 9054 |
| Base 3 | 1212200110 |
| As time | 36948 seconds = 10 h 15 min 48 s |
Is 36948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36948 ÷ 2 = 18474) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (36948 ÷ 3 = 12316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (36948 ÷ 4 = 9237) | 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 | Yes (36948 ÷ 6 = 6158) | 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 4) | 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 8) | 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 | Yes (36948 ÷ 12 = 3079) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36948 a prime number?
No. 36948 = × 3 × 3079, so it is divisible by 2.
What are the factors of 36948?
1, 2, 3, 4, 6, 12, 3079, 6158, 9237, 12316, 18474, 36948.
What is 36948 in binary?
1001000001010100 (hexadecimal 9054, octal 110124).
What is the square root of 36948?
About 192.2186, exactly 2√9237.
Is 36948 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 36948?
It is a composite number with 12 divisors.