The number 55036
55036 is a composite number with 6 divisors. Its prime factorisation is × 13759. Divisors (6): 1, 2, 4, 13759, 27518, 55036.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55036 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55036 is composite. Its prime factorisation is
- 3
The divisors add up to 96320; without 55036 itself that is 41284, so 55036 is deficient (41284 is less than 55036). Euler's totient φ(55036) = 27516 numbers up to 55036 share no factor with it.
- 4
The digits of 55036 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55036 = 2^{2} \times 13759 \]55036 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 96320 |
| Euler totient φ(n) | 27516 |
| Square | 3028961296 |
| Cube | 166701913886656 |
| Square root | 234.597528 (= 2√13759) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5036 × |
55036 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and thirty-six |
| Binary (base 2) | 1101011011111100 |
| Octal (base 8) | 153374 |
| Hexadecimal (base 16) | D6FC |
| Base 3 | 2210111101 |
| As time | 55036 seconds = 15 h 17 min 16 s |
Is 55036 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55036 ÷ 2 = 27518) | 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 | Yes (55036 ÷ 4 = 13759) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55036 a prime number?
No. 55036 = × 13759, so it is divisible by 2.
What are the factors of 55036?
1, 2, 4, 13759, 27518, 55036.
What is 55036 in binary?
1101011011111100 (hexadecimal D6FC, octal 153374).
What is the square root of 55036?
About 234.5975, exactly 2√13759.
Is 55036 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 55036?
It is a composite number with 6 divisors.